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:18boop34boop34Score: 11,645Success
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:1911,527390,217,366375,705,0004,697,0002,113,536
2Jul 23, 2026 17:1911,598392,578,526377,901,0004,834,0002,113,536
3Jul 23, 2026 17:1911,620393,204,189378,433,0005,046,0002,113,536
4Jul 23, 2026 17:1911,628393,675,770378,577,0005,170,0002,113,536
5Jul 23, 2026 17:1911,645394,064,121379,235,0005,061,0002,113,536
6Jul 23, 2026 17:1911,646394,065,368379,429,0004,891,0002,113,536
7Jul 23, 2026 17:1911,646394,113,339378,725,0005,613,0002,113,536
8Jul 23, 2026 17:1911,647394,120,875379,107,0005,262,0002,113,536
9Jul 23, 2026 17:1911,655394,450,276379,509,0005,128,0002,113,536