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 listJun 7, 2026 18:34anboto1anboto1Score: 22,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 18:3522,202742,453,552690,776,00041,906,0002,113,536
2Jun 7, 2026 18:3522,266744,609,408692,011,00042,788,0002,113,536
3Jun 7, 2026 18:3522,297745,395,587693,916,00041,902,0002,113,536
4Jun 7, 2026 18:3522,358747,550,166695,652,00042,187,0002,113,536
5Jun 7, 2026 18:3522,403749,027,407697,386,00041,944,0002,113,536
6Jun 7, 2026 18:3522,408749,220,702696,840,00042,649,0002,113,536
7Jun 7, 2026 18:3522,422749,312,611698,042,00041,891,0002,113,536
8Jun 7, 2026 18:3522,430749,491,804696,930,00043,275,0002,113,536
9Jun 7, 2026 18:3522,530753,277,880701,333,00042,179,0002,113,536