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 16:01highloadLLMhighloadLLMScore: 60,420Success
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 16:0260,3171,999,938,3721,943,399,00047,091,0002,113,536
2Jun 7, 2026 16:0260,3772,002,233,4061,944,756,00047,690,0002,113,536
3Jun 7, 2026 16:0260,3922,002,671,3281,945,845,00047,114,0002,113,536
4Jun 7, 2026 16:0260,4142,003,490,5821,946,297,00047,392,0002,113,536
5Jun 7, 2026 16:0260,4202,003,257,7721,946,605,00047,275,0002,113,536
6Jun 7, 2026 16:0260,8892,018,752,7011,962,447,00046,903,0002,113,536
7Jun 7, 2026 16:0260,9722,021,927,7231,964,874,00047,215,0002,113,536
8Jun 7, 2026 16:0261,1332,026,848,6691,969,787,00047,606,0002,113,536
9Jun 7, 2026 16:0261,8842,051,972,9641,992,834,00049,362,0002,113,536