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 21, 2026 18:17M-RochatM-RochatScore: 18,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:1818,285612,909,843599,375,0004,039,0002,113,536
2May 21, 2026 18:1818,350616,103,328601,553,0004,023,0002,113,536
3May 21, 2026 18:1818,430618,637,702604,193,0004,008,0002,113,536
4May 21, 2026 18:1818,441620,747,317604,564,0004,012,0002,113,536
5May 21, 2026 18:1818,588625,772,278609,412,0004,010,0002,113,536
6May 21, 2026 18:1818,846632,369,043617,888,0004,056,0002,113,536
7May 21, 2026 18:1819,686660,102,134645,565,0004,100,0002,113,536
8May 21, 2026 18:1819,704662,744,206646,197,0004,049,0002,113,536
9May 21, 2026 18:1819,820665,788,423650,037,0004,032,0002,113,536