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 31, 2026 13:06Victor MerckléVictor MerckléScore: 1,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 13:071,70651,190,160121,943,0002,024,0002,170,880stderr
2Aug 31, 2026 13:071,74052,227,688125,371,0001,312,0002,170,880stderr
3Aug 31, 2026 13:071,75352,599,636126,423,0002,038,0002,170,880stderr
4Aug 31, 2026 13:071,76052,822,926126,909,0002,006,0002,170,880stderr
5Aug 31, 2026 13:071,76052,811,812124,766,0002,067,0002,170,880stderr
6Aug 31, 2026 13:071,78153,448,239128,575,0001,027,0002,170,880stderr
7Aug 31, 2026 13:071,81054,326,356127,555,0001,026,0002,170,880stderr
8Aug 31, 2026 13:071,87156,140,478133,020,0001,034,0002,170,880stderr
9Aug 31, 2026 13:071,93358,011,033138,052,0001,023,0002,170,880stderr