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 08:08M-RochatM-RochatScore: 18,908Success
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 08:1018,635626,497,277611,966,0003,009,0002,113,536
2May 17, 2026 08:1018,740630,443,918615,424,0003,010,0002,113,536
3May 17, 2026 08:1018,781630,986,860616,548,0003,238,0002,113,536
4May 17, 2026 08:1018,870631,567,227619,580,0003,136,0002,113,536
5May 17, 2026 08:1018,908633,184,215620,589,0003,375,0002,113,536
6May 17, 2026 08:1019,535654,391,964641,656,0003,008,0002,113,536
7May 17, 2026 08:1019,950667,110,933655,346,0003,015,0002,113,536
8May 17, 2026 08:1019,953669,045,577655,474,0003,006,0002,113,536
9May 17, 2026 08:1020,102673,087,918660,370,0003,007,0002,113,536