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 20:41Victor MerckléVictor MerckléScore: 2,144Success
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 20:422,12563,771,399159,389,0001,222,0002,170,880stderr
2Aug 16, 2026 20:422,12563,760,140159,242,0001,234,0002,170,880stderr
3Aug 16, 2026 20:422,13964,184,051160,139,0001,246,0002,170,880stderr
4Aug 16, 2026 20:422,14064,222,197159,263,0001,228,0002,170,880stderr
5Aug 16, 2026 20:422,14464,342,722158,717,0001,246,0002,170,880stderr
6Aug 16, 2026 20:422,15264,563,961158,230,0001,240,0002,170,880stderr
7Aug 16, 2026 20:422,16865,044,988159,024,0001,244,0002,170,880stderr
8Aug 16, 2026 20:422,18665,606,407160,105,0001,251,0002,170,880stderr
9Aug 16, 2026 20:422,29368,806,005159,660,0001,242,0002,170,880stderr