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 6, 2026 02:24zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 15:47Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 15:47010,816,9831,042,0002,102,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 15:47010,891,8031,040,0002,171,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 15:47010,985,1731,536,0001,536,0002,121,728expected "16384 ", got "349 "stderr
4Jan 6, 2026 02:243,253130,907,346103,334,0004,012,0002,416,640
5Jan 6, 2026 02:243,301136,309,036104,932,0003,997,0002,420,736
6Jan 6, 2026 02:244,580178,632,079148,136,0003,002,0002,420,736