Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 listSep 1, 2026 07:35Victor MerckléVictor MerckléScore: 2,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 07:362,03060,919,290151,146,0001,278,0002,170,880stderr
2Sep 1, 2026 07:362,03360,997,075151,530,0001,279,0002,170,880stderr
3Sep 1, 2026 07:362,03761,116,681151,604,0002,045,0002,170,880stderr
4Sep 1, 2026 07:362,03961,194,982151,074,0002,016,0002,170,880stderr
5Sep 1, 2026 07:362,03961,185,992152,431,0001,270,0002,170,880stderr
6Sep 1, 2026 07:362,04261,276,375151,614,0002,039,0002,170,880stderr
7Sep 1, 2026 07:362,04261,265,036151,626,0002,030,0002,170,880stderr
8Sep 1, 2026 07:362,05461,621,717152,946,0001,028,0002,170,880stderr
9Sep 1, 2026 07:362,05961,797,579152,016,0001,039,0002,170,880stderr