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 listJul 24, 2026 20:58boop34boop34Score: 8,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 21:008,505292,707,285273,803,0006,864,0002,113,536
2Jul 24, 2026 21:008,514292,011,399273,845,0007,126,0002,113,536
3Jul 24, 2026 21:008,525293,158,032274,406,0006,951,0002,113,536
4Jul 24, 2026 21:008,531291,277,927273,908,0007,646,0002,113,536
5Jul 24, 2026 21:008,533291,316,447273,893,0007,705,0002,113,536
6Jul 24, 2026 21:008,543291,679,866274,307,0007,622,0002,113,536
7Jul 24, 2026 21:008,552292,078,520274,013,0008,211,0002,113,536
8Jul 24, 2026 21:008,557292,333,702274,148,0008,257,0002,113,536
9Jul 24, 2026 21:008,567292,541,869274,410,0008,301,0002,113,536