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 23, 2026 15:42Victor MerckléVictor MerckléScore: 2,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 15:441,98559,566,521146,827,0001,030,0002,170,880stderr
2Aug 23, 2026 15:442,00560,158,673147,950,0002,027,0002,170,880stderr
3Aug 23, 2026 15:442,02060,601,973147,985,0001,035,0002,170,880stderr
4Aug 23, 2026 15:442,03060,919,820147,950,0002,031,0002,170,880stderr
5Aug 23, 2026 15:442,03361,007,090147,451,0001,036,0002,170,880stderr
6Aug 23, 2026 15:442,06962,085,422152,314,0002,039,0002,170,880stderr
7Aug 23, 2026 15:442,07162,135,493149,993,0001,033,0002,170,880stderr
8Aug 23, 2026 15:442,08162,447,250151,182,0001,029,0002,170,880stderr
9Aug 23, 2026 15:442,55176,547,925169,547,0001,068,0002,170,880stderr