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 1, 2026 16:35zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 01:02Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 01:02010,929,4451,043,0002,131,0002,121,728expected "16384 ", got "353 "stderr
2Jul 5, 2026 01:02010,977,2001,041,0002,108,0002,121,728expected "16384 ", got "353 "stderr
3Jul 5, 2026 01:02011,505,6671,042,0002,160,0002,121,728expected "16384 ", got "353 "stderr
4Jan 1, 2026 16:353,518135,573,646115,098,0001,000,0002,416,640
5Jan 1, 2026 16:353,539143,902,980115,774,000998,0002,273,280
6Jan 1, 2026 16:353,637142,358,109117,022,0003,000,0002,535,424