Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listJun 8, 2026 01:54anboto1anboto1Score: 9,783Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 01:559,604326,675,534304,314,00012,637,0002,117,632
2Jun 8, 2026 01:559,635327,370,319305,963,00012,010,0002,117,632
3Jun 8, 2026 01:559,691329,161,183307,809,00012,002,0002,117,632
4Jun 8, 2026 01:559,693329,555,229307,871,00012,006,0002,117,632
5Jun 8, 2026 01:559,783332,114,726310,315,00012,556,0002,117,632
6Jun 8, 2026 01:559,803333,335,755311,395,00012,118,0002,117,632
7Jun 8, 2026 01:559,816333,571,098311,817,00012,113,0002,117,632
8Jun 8, 2026 01:559,979339,103,047317,188,00012,126,0002,117,632
9Jun 8, 2026 01:559,992338,999,813316,879,00012,867,0002,117,632