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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:23Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:23011,018,3931,534,0001,534,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 13:23010,928,3721,507,0001,509,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 13:23011,023,9631,522,0001,522,0002,121,728expected "16384 ", got "349 "stderr
4Jan 6, 2026 02:273,293134,375,967106,647,0002,012,0002,404,352
5Jan 6, 2026 02:274,032163,021,105130,049,0003,001,0002,408,448
6Jan 6, 2026 02:274,277163,028,404138,145,0003,003,0002,420,736