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 listOct 16, 2026 20:31KacpxerKacpxerScore: 21,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 20:3421,665726,948,115683,432,00031,529,0002,138,112
2Oct 16, 2026 20:3421,711728,613,879686,044,00030,438,0002,138,112
3Oct 16, 2026 20:3421,719730,161,159685,128,00031,600,0002,138,112
4Oct 16, 2026 20:3421,767730,415,999685,716,00032,602,0002,138,112
5Oct 16, 2026 20:3421,767730,099,326686,958,00031,357,0002,138,112
6Oct 16, 2026 20:3421,802731,168,150688,429,00031,066,0002,138,112
7Oct 16, 2026 20:3421,873733,294,998690,655,00031,178,0002,138,112
8Oct 16, 2026 20:3421,886733,154,534690,926,00031,342,0002,138,112
9Oct 16, 2026 20:3421,940735,970,647692,151,00031,873,0002,138,112