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 18, 2026 01:48M-RochatM-RochatScore: 18,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:5018,332617,095,550600,889,0004,097,0002,113,536
2May 18, 2026 01:5018,460619,897,461605,186,0004,020,0002,113,536
3May 18, 2026 01:5018,513622,515,415606,899,0004,039,0002,113,536
4May 18, 2026 01:5018,524620,737,007607,293,0004,026,0002,113,536
5May 18, 2026 01:5018,574624,950,240608,912,0004,038,0002,113,536
6May 18, 2026 01:5018,829632,175,388617,320,0004,048,0002,113,536
7May 18, 2026 01:5018,845633,546,176617,897,0004,005,0002,113,536
8May 18, 2026 01:5019,626658,952,956643,651,0004,015,0002,113,536
9May 18, 2026 01:5019,766664,479,950648,240,0004,046,0002,113,536