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 08:39Victor MerckléVictor MerckléScore: 1,795Success
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 08:401,77053,112,784125,907,0002,021,0002,170,880stderr
2Aug 24, 2026 08:401,78953,673,741127,016,0002,069,0002,170,880stderr
3Aug 24, 2026 08:401,79553,873,161127,405,0001,027,0002,170,880stderr
4Aug 24, 2026 08:401,79553,874,452126,517,0001,034,0002,170,880stderr
5Aug 24, 2026 08:401,79553,873,504127,181,0001,044,0002,170,880stderr
6Aug 24, 2026 08:401,79853,945,375126,029,0001,033,0002,170,880stderr
7Aug 24, 2026 08:401,81854,542,057130,925,0001,296,0002,170,880stderr
8Aug 24, 2026 08:401,83655,092,998129,053,0001,025,0002,170,880stderr
9Aug 24, 2026 08:401,90457,126,670124,973,0002,016,0002,170,880stderr