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 17, 2026 02:40Victor MerckléVictor MerckléScore: 2,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 02:512,38771,626,483184,668,0001,239,0002,170,880stderr
2Aug 17, 2026 02:512,38871,651,202183,486,0001,249,0002,170,880stderr
3Aug 17, 2026 02:512,39071,709,444183,624,0001,227,0002,170,880stderr
4Aug 17, 2026 02:512,40172,059,923184,653,0001,242,0002,170,880stderr
5Aug 17, 2026 02:512,41172,352,901183,523,0001,229,0002,170,880stderr
6Aug 17, 2026 02:512,42372,711,491185,219,0001,217,0002,170,880stderr
7Aug 17, 2026 02:512,42372,694,630184,363,0001,242,0002,170,880stderr
8Aug 17, 2026 02:512,42672,808,589185,339,0001,224,0002,170,880stderr
9Aug 17, 2026 02:512,44073,201,899184,719,0001,234,0002,170,880stderr