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 8, 2026 20:16Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 08:41Tomislav Tunkovic14.27CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 08:430305,375,178291,737,0003,288,0002,117,632expected "2919922 ", got "2919581 "
2Sep 9, 2026 08:430308,254,344294,429,0003,007,0002,117,632expected "2919947 ", got "2919637 "
3Sep 9, 2026 08:430306,887,164293,716,0003,024,0002,117,632expected "2919939 ", got "2919610 "
4Jan 8, 2026 20:168,735313,212,037285,256,0003,002,0002,379,776
5Jan 8, 2026 20:168,864318,175,331287,535,0004,991,0002,355,200
6Jan 8, 2026 20:169,575340,791,985311,962,0003,999,0002,482,176