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 listApr 3, 2026 16:57Ondřej PolaneckýOndřej PolaneckýScore: 22,307Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2026 16:5722,207760,889,795725,846,0006,998,0002,437,120
2Apr 3, 2026 16:5722,223762,260,398726,358,0006,993,0002,334,720
3Apr 3, 2026 16:5722,223758,834,851725,371,0007,993,0002,482,176
4Apr 3, 2026 16:5722,263759,787,731726,693,0007,996,0002,379,776
5Apr 3, 2026 16:5722,307759,988,137728,143,0007,990,0002,486,272
6Apr 3, 2026 16:5722,333762,544,030730,981,0005,999,0002,424,832
7Apr 3, 2026 16:5722,364766,168,242731,020,0007,000,0002,408,448
8Apr 3, 2026 16:5722,599771,950,092738,776,0006,997,0002,293,760
9Apr 3, 2026 16:5723,271799,220,792759,953,0007,989,0002,330,624