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 listJan 12, 2026 22:05Adam FolwarcznyAdam FolwarcznyScore: 59,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 22:0559,1151,974,120,7021,932,798,00017,988,0002,277,376
2Jan 12, 2026 22:0559,2351,981,760,9371,942,777,00011,992,0002,519,040
3Jan 12, 2026 22:0559,2631,983,527,9701,941,691,00013,990,0002,428,928
4Jan 12, 2026 22:0559,4221,988,455,6551,944,941,00015,991,0002,445,312
5Jan 12, 2026 22:0559,4801,989,714,9431,948,857,00013,991,0002,465,792
6Jan 12, 2026 22:0559,5291,993,093,2301,950,477,00013,989,0002,293,760
7Jan 12, 2026 22:0559,6671,992,852,5441,956,005,00012,993,0002,334,720
8Jan 12, 2026 22:0559,7652,002,939,1451,961,262,00010,995,0002,273,280
9Jan 12, 2026 22:0561,5142,064,275,3922,016,974,00012,986,0002,433,024