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 22, 2026 18:24Victor MerckléVictor MerckléScore: 4,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 18:254,976171,669,964127,568,00036,661,0002,113,536
2Jun 22, 2026 18:254,981171,949,108127,567,00036,830,0002,113,536
3Jun 22, 2026 18:254,990172,697,040127,829,00036,856,0002,113,536
4Jun 22, 2026 18:254,991172,542,877127,884,00036,845,0002,113,536
5Jun 22, 2026 18:254,995172,295,527127,965,00036,884,0002,113,536
6Jun 22, 2026 18:255,008172,775,626128,521,00036,761,0002,113,536
7Jun 22, 2026 18:255,008172,843,767128,514,00036,779,0002,113,536
8Jun 22, 2026 18:255,015173,039,462127,640,00037,875,0002,113,536
9Jun 22, 2026 18:255,015173,065,415127,855,00037,672,0002,113,536