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:22zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 23:47Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 23:48010,961,3851,041,0002,138,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 23:48011,368,8711,040,0002,165,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 23:48011,044,0351,523,0001,523,0002,121,728expected "16384 ", got "349 "stderr
4Jan 6, 2026 02:223,315128,878,465106,382,0003,010,0002,408,448
5Jan 6, 2026 02:233,339131,987,399109,198,0001,001,0002,408,448
6Jan 6, 2026 02:233,495139,050,988111,368,0003,977,0002,535,424
7Jan 6, 2026 02:223,513140,710,112114,914,000999,0002,416,640
8Jan 6, 2026 02:223,577138,717,632114,042,0004,001,0002,416,640
9Jan 6, 2026 02:234,376171,335,253143,420,0001,002,0002,420,736