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 25, 2026 17:23boop34boop34Score: 7,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2026 17:246,940241,377,104223,451,0005,572,0002,113,536
2Jul 25, 2026 17:246,953241,593,530223,760,0005,707,0002,113,536
3Jul 25, 2026 17:246,996242,881,197224,892,0006,008,0002,113,536
4Jul 25, 2026 17:247,015241,443,099223,834,0007,687,0002,113,536
5Jul 25, 2026 17:247,019241,486,079224,023,0007,634,0002,113,536
6Jul 25, 2026 17:247,025242,539,352224,148,0007,700,0002,113,536
7Jul 25, 2026 17:247,031241,924,874224,490,0007,547,0002,113,536
8Jul 25, 2026 17:247,035242,222,026224,693,0007,467,0002,113,536
9Jul 25, 2026 17:247,077243,462,467225,435,0008,125,0002,113,536