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 22, 2026 19:55M-RochatM-RochatScore: 28,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 19:5627,912930,928,028906,666,00014,435,0002,113,536
2May 22, 2026 19:5627,927932,115,449907,125,00014,488,0002,113,536
3May 22, 2026 19:5627,956933,120,516908,196,00014,355,0002,113,536
4May 22, 2026 19:5628,318943,988,525919,781,00014,735,0002,113,536
5May 22, 2026 19:5628,850962,315,786937,142,00014,940,0002,113,536
6May 22, 2026 19:5628,974968,267,677941,126,00015,048,0002,113,536
7May 22, 2026 19:5628,987966,078,282941,553,00015,037,0002,113,536
8May 22, 2026 19:5629,001966,524,753942,012,00015,046,0002,113,536
9May 22, 2026 19:5629,161974,744,467947,325,00014,999,0002,113,536