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 15:00Victor MerckléVictor MerckléScore: 3,341Success
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 15:033,32099,600,559269,237,0001,037,0002,170,880stderr
2Aug 17, 2026 15:033,32699,791,891269,553,0001,115,0002,170,880stderr
3Aug 17, 2026 15:033,333100,015,751270,524,0001,040,0002,170,880stderr
4Aug 17, 2026 15:033,336100,084,040269,158,0001,044,0002,170,880stderr
5Aug 17, 2026 15:033,341100,239,802270,710,0001,001,0002,170,880stderr
6Aug 17, 2026 15:033,343100,290,081270,729,0001,048,0002,170,880stderr
7Aug 17, 2026 15:033,345100,365,671270,021,0001,130,0002,170,880stderr
8Aug 17, 2026 15:033,357100,734,211270,460,0001,037,0002,170,880stderr
9Aug 17, 2026 15:033,397101,910,985271,121,0001,142,0002,170,880stderr