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:44M-RochatM-RochatScore: 26,307Success
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:4524,498818,022,260803,407,0005,027,0002,113,536
2May 18, 2026 01:4524,532820,858,237804,524,0005,048,0002,113,536
3May 18, 2026 01:4524,678824,808,126810,276,0004,126,0002,113,536
4May 18, 2026 01:4524,987836,290,227820,461,0004,140,0002,113,536
5May 18, 2026 01:4526,307879,574,932863,074,0005,083,0002,113,536
6May 18, 2026 01:4526,396882,347,283866,066,0005,020,0002,113,536
7May 18, 2026 01:4526,521884,543,048870,087,0005,118,0002,113,536
8May 18, 2026 01:4526,662889,737,921874,723,0005,135,0002,113,536
9May 18, 2026 01:4526,674890,116,131875,221,0005,032,0002,113,536