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 7, 2026 19:04zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 14:48Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 14:48011,034,6271,047,0002,222,0002,121,728expected "16384 ", got "1056 "stderr
2Jul 4, 2026 14:48010,926,4721,045,0002,160,0002,121,728expected "16384 ", got "1056 "stderr
3Jul 4, 2026 14:48010,898,3711,037,0002,098,0002,121,728expected "16384 ", got "1056 "stderr
4Jan 7, 2026 19:043,205129,905,992103,781,0001,995,0002,535,424
5Jan 7, 2026 19:043,274129,389,354105,044,0003,001,0002,535,424
6Jan 7, 2026 19:043,302130,778,752106,960,0001,999,0002,273,280