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:27Victor MerckléVictor MerckléError
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:28074,349,095192,309,0001,132,0002,170,880expected "1022612 ", got "1022611 "stderr
2Aug 23, 2026 15:282,47574,260,139191,107,0001,059,0002,170,880stderr
3Aug 23, 2026 15:282,48174,456,337192,931,0001,001,0002,170,880stderr
4Aug 23, 2026 15:282,50075,013,960192,117,0001,042,0002,170,880stderr
5Aug 23, 2026 15:282,50275,087,980192,527,0001,063,0002,170,880stderr
6Aug 23, 2026 15:282,51375,401,061191,632,0001,053,0002,170,880stderr
7Aug 23, 2026 15:282,52975,890,476193,623,0001,055,0002,170,880stderr
8Aug 23, 2026 15:282,54776,430,278195,428,0001,065,0002,170,880stderr
9Aug 23, 2026 15:282,55676,684,109195,210,0001,061,0002,170,880stderr