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 listMar 19, 2026 00:02Dominique GarmierDominique GarmierError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 17:23Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 17:240287,716,655272,877,0004,075,0002,113,536expected "2900871 ", got "1984148 "
2Oct 31, 2026 17:240293,464,009279,820,0003,012,0002,113,536expected "2905752 ", got "1988857 "
3Oct 31, 2026 17:240291,544,317277,812,0003,011,0002,113,536expected "2902441 ", got "1985648 "
4Mar 19, 2026 00:0216,751577,637,429545,775,0006,997,0002,457,600
5Mar 19, 2026 00:0216,765584,100,624546,244,0007,003,0002,273,280
6Mar 19, 2026 00:0217,011587,664,234555,359,0005,993,0002,461,696