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 2, 2026 13:50Victor MerckléVictor MerckléScore: 4,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 13:514,849145,480,605402,318,0004,600,0002,650,112stderr
2Aug 2, 2026 13:514,886146,602,606402,653,0005,695,0002,650,112stderr
3Aug 2, 2026 13:514,903147,111,350404,925,0005,530,0002,654,208stderr
4Aug 2, 2026 13:514,933147,996,877408,099,0005,443,0002,650,112stderr
5Aug 2, 2026 13:514,936148,095,008409,789,0004,468,0002,650,112stderr
6Aug 2, 2026 13:514,953148,591,923410,052,0005,534,0002,650,112stderr
7Aug 2, 2026 13:514,993149,814,130411,319,0005,600,0002,650,112stderr
8Aug 2, 2026 13:515,005150,158,212412,035,0005,637,0002,654,208stderr
9Aug 2, 2026 13:515,021150,649,960410,963,0005,913,0002,650,112stderr