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 23, 2026 17:25boop34boop34Score: 10,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 17:2610,412353,366,534338,631,0004,983,0002,113,536
2Jul 23, 2026 17:2610,486355,769,489340,919,0005,131,0002,113,536
3Jul 23, 2026 17:2610,486355,901,832340,831,0005,219,0002,113,536
4Jul 23, 2026 17:2610,493356,071,214341,197,0005,103,0002,113,536
5Jul 23, 2026 17:2610,500356,266,099341,415,0005,096,0002,113,536
6Jul 23, 2026 17:2610,504356,479,237341,710,0004,954,0002,113,536
7Jul 23, 2026 17:2610,544357,784,591342,884,0005,090,0002,113,536
8Jul 23, 2026 17:2610,581358,943,289344,279,0004,922,0002,113,536
9Jul 23, 2026 17:2610,784365,715,917350,795,0005,095,0002,113,536