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 27, 2026 05:40Victor MerckléVictor MerckléScore: 6,417Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 05:416,407218,969,981174,743,00036,720,0002,113,536
2Jun 27, 2026 05:416,407219,457,805174,649,00036,796,0002,113,536
3Jun 27, 2026 05:416,413219,714,072174,901,00036,748,0002,113,536
4Jun 27, 2026 05:416,414219,224,895174,876,00036,793,0002,113,536
5Jun 27, 2026 05:416,417219,714,920175,086,00036,682,0002,113,536
6Jun 27, 2026 05:416,418220,834,080174,268,00037,530,0002,113,536
7Jun 27, 2026 05:416,422219,763,538175,165,00036,785,0002,113,536
8Jun 27, 2026 05:416,435220,381,874175,590,00036,774,0002,113,536
9Jun 27, 2026 05:416,438220,054,629174,639,00037,845,0002,113,536