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 3, 2026 05:04Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 21:40Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 21:40013,755,9962,882,0001,440,0002,125,824expected "16384 ", got "445 "stderr
2Jul 4, 2026 21:40014,475,2692,269,0002,271,0002,125,824expected "16384 ", got "445 "stderr
3Jul 4, 2026 21:40015,586,0632,890,0001,445,0002,125,824expected "16384 ", got "445 "stderr
4Jan 3, 2026 05:043,444141,989,921109,650,0003,987,0002,371,584
5Jan 3, 2026 05:043,452141,516,811109,917,0003,997,0002,396,160
6Jan 3, 2026 05:043,521139,009,648112,196,0004,007,0002,510,848