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 08:53Victor MerckléVictor MerckléScore: 2,970Success
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 09:022,93588,067,570232,728,0001,025,0002,170,880stderr
2Aug 16, 2026 09:022,95688,693,931233,394,0001,029,0002,170,880stderr
3Aug 16, 2026 09:022,95688,708,882233,911,0002,037,0002,170,880stderr
4Aug 16, 2026 09:022,95988,786,071234,219,0002,026,0002,170,880stderr
5Aug 16, 2026 09:022,97089,101,339232,984,0001,018,0002,170,880stderr
6Aug 16, 2026 09:022,97389,198,647233,873,0002,022,0002,170,880stderr
7Aug 16, 2026 09:022,97889,340,434235,625,0001,025,0002,170,880stderr
8Aug 16, 2026 09:022,99989,997,699235,513,0002,021,0002,170,880stderr
9Aug 16, 2026 09:023,00090,029,121233,646,0001,022,0002,170,880stderr