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 listSep 1, 2026 10:37Victor MerckléVictor MerckléScore: 1,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 10:381,69650,889,604119,603,0001,053,0002,170,880stderr
2Sep 1, 2026 10:381,71951,588,578121,122,0001,031,0002,170,880stderr
3Sep 1, 2026 10:381,72251,684,036120,361,0002,053,0002,170,880stderr
4Sep 1, 2026 10:381,73552,072,453122,542,0001,041,0002,170,880stderr
5Sep 1, 2026 10:381,74052,212,715121,799,0001,030,0002,170,880stderr
6Sep 1, 2026 10:381,74852,466,381122,609,0002,049,0002,170,880stderr
7Sep 1, 2026 10:381,75252,582,470121,540,0001,033,0002,170,880stderr
8Sep 1, 2026 10:381,75652,706,174122,023,0002,030,0002,170,880stderr
9Sep 1, 2026 10:382,27968,376,899142,931,0001,093,0002,170,880stderr