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 listAug 16, 2026 16:37Victor MerckléVictor MerckléScore: 2,099Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 16:382,05561,668,744154,474,0001,230,0002,170,880stderr
2Aug 16, 2026 16:382,06361,911,921155,149,0001,217,0002,170,880stderr
3Aug 16, 2026 16:382,08662,587,343153,627,0001,255,0002,170,880stderr
4Aug 16, 2026 16:382,09162,730,851155,071,0001,222,0002,170,880stderr
5Aug 16, 2026 16:382,09962,984,211155,856,0001,219,0002,170,880stderr
6Aug 16, 2026 16:382,10763,239,925153,994,0001,237,0002,170,880stderr
7Aug 16, 2026 16:382,10863,269,837152,829,0001,248,0002,170,880stderr
8Aug 16, 2026 16:382,11163,334,643154,292,0001,226,0002,170,880stderr
9Aug 16, 2026 16:382,12163,635,292154,200,0001,251,0002,170,880stderr