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 03:39Victor MerckléVictor MerckléScore: 4,909Success
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 03:504,804144,122,410399,293,0003,224,0002,224,128stderr
2Aug 17, 2026 03:504,819144,588,661400,153,0003,226,0002,191,360stderr
3Aug 17, 2026 03:504,839145,181,666400,859,0002,082,0002,170,880stderr
4Aug 17, 2026 03:504,896146,887,201405,197,0004,066,0002,228,224stderr
5Aug 17, 2026 03:504,909147,288,605405,949,0002,175,0002,170,880stderr
6Aug 17, 2026 03:504,925147,765,240407,124,0003,032,0002,170,880stderr
7Aug 17, 2026 03:504,934148,033,948408,957,0002,179,0002,170,880stderr
8Aug 17, 2026 03:504,944148,324,762409,504,0002,206,0002,170,880stderr
9Aug 17, 2026 03:504,971149,136,984409,121,0003,279,0002,170,880stderr