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 listJan 13, 2026 23:18Adam FolwarcznyAdam FolwarcznyScore: 16,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 23:1815,922549,842,950516,431,0008,990,0002,359,296
2Jan 13, 2026 23:1815,985553,690,994518,498,0008,991,0002,371,584
3Jan 13, 2026 23:1816,029560,293,039520,962,0007,999,0002,514,944
4Jan 13, 2026 23:1816,050556,820,981519,645,0009,993,0002,306,048
5Jan 13, 2026 23:1816,074553,601,414522,446,0007,991,0002,473,984
6Jan 13, 2026 23:1816,137559,004,956522,541,0009,991,0002,342,912
7Jan 13, 2026 23:1816,140572,133,801522,641,0009,993,0002,273,280
8Jan 13, 2026 23:1816,176561,757,027520,803,00012,995,0002,424,832
9Jan 13, 2026 23:1816,379563,343,535530,524,0009,991,0002,514,944