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 17, 2026 02:05M-RochatM-RochatScore: 19,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 02:0919,243644,987,598631,682,0003,340,0002,113,536
2May 17, 2026 02:0919,288645,973,176633,182,0003,336,0002,113,536
3May 17, 2026 02:0919,323646,661,886634,657,0003,009,0002,113,536
4May 17, 2026 02:0919,444651,751,971638,349,0003,332,0002,113,536
5May 17, 2026 02:0919,470654,520,988639,173,0003,363,0002,113,536
6May 17, 2026 02:0919,474652,050,785639,392,0003,253,0002,113,536
7May 17, 2026 02:0919,482652,171,041639,731,0003,181,0002,113,536
8May 17, 2026 02:0919,488652,016,045639,871,0003,242,0002,113,536
9May 17, 2026 02:0919,554654,008,963642,024,0003,280,0002,113,536