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:51M-RochatM-RochatScore: 18,496Success
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:5218,299615,862,101599,865,0004,006,0002,113,536
2May 18, 2026 01:5218,334616,801,268601,040,0004,013,0002,113,536
3May 18, 2026 01:5218,403616,956,600604,306,0003,011,0002,113,536
4May 18, 2026 01:5218,411617,352,062603,564,0004,029,0002,113,536
5May 18, 2026 01:5218,496621,563,959607,371,0003,008,0002,113,536
6May 18, 2026 01:5218,566622,123,233608,643,0004,040,0002,113,536
7May 18, 2026 01:5218,690626,154,380612,738,0004,049,0002,113,536
8May 18, 2026 01:5219,209645,846,746630,896,0003,010,0002,113,536
9May 18, 2026 01:5219,719661,055,837646,627,0004,132,0002,113,536