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 listMay 13, 2026 19:35Pavel SkripkinPavel SkripkinScore: 16,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 19:3616,314545,829,041535,314,0003,069,0002,117,632
2May 13, 2026 19:3616,367549,611,100537,023,0003,114,0002,117,632
3May 13, 2026 19:3616,454550,371,476539,958,0003,036,0002,117,632
4May 13, 2026 19:3616,550553,629,227542,799,0003,354,0002,117,632
5May 13, 2026 19:3616,589555,157,962544,164,0003,291,0002,117,632
6May 13, 2026 19:3616,666558,166,848546,919,0003,090,0002,117,632
7May 13, 2026 19:3616,803564,701,489551,440,0003,081,0002,117,632
8May 13, 2026 19:3616,888566,230,492554,112,0003,202,0002,117,632
9May 13, 2026 19:3617,490584,629,883574,012,0003,185,0002,117,632