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 18, 2026 15:03Victor MerckléVictor MerckléScore: 2,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 15:061,94558,361,280142,743,0001,028,0002,170,880stderr
2Aug 18, 2026 15:061,96558,959,956144,536,0002,055,0002,170,880stderr
3Aug 18, 2026 15:061,97459,244,959145,126,0002,021,0002,170,880stderr
4Aug 18, 2026 15:062,00260,072,334146,106,0001,030,0002,170,880stderr
5Aug 18, 2026 15:062,00860,256,150146,522,0001,032,0002,170,880stderr
6Aug 18, 2026 15:062,02760,827,109146,111,0001,041,0002,170,880stderr
7Aug 18, 2026 15:062,03060,910,169148,557,0001,029,0002,170,880stderr
8Aug 18, 2026 15:062,03661,105,737148,819,0002,023,0002,170,880stderr
9Aug 18, 2026 15:062,07562,275,365152,753,0001,035,0002,170,880stderr