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 24, 2026 09:20Victor MerckléVictor MerckléScore: 1,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 09:211,66549,954,006118,318,0002,005,0002,170,880stderr
2Aug 24, 2026 09:211,66850,067,667118,643,0002,024,0002,170,880stderr
3Aug 24, 2026 09:211,67150,145,064118,310,0001,014,0002,170,880stderr
4Aug 24, 2026 09:211,67450,240,810117,699,0001,009,0002,170,880stderr
5Aug 24, 2026 09:211,68150,447,828119,109,0002,022,0002,170,880stderr
6Aug 24, 2026 09:211,68750,639,114120,204,0001,010,0002,170,880stderr
7Aug 24, 2026 09:211,70051,027,549119,761,0002,019,0002,170,880stderr
8Aug 24, 2026 09:211,70251,061,446119,010,0001,029,0002,170,880stderr
9Aug 24, 2026 09:211,70451,129,433119,265,0001,017,0002,170,880stderr