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 listJun 26, 2026 01:57Victor MerckléVictor MerckléScore: 2,888Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 01:582,86285,872,192229,580,0003,287,0002,420,736
2Jun 26, 2026 01:582,86986,073,141230,221,0003,143,0002,662,400
3Jun 26, 2026 01:582,87386,212,044230,814,0003,120,0002,662,400
4Jun 26, 2026 01:582,88886,651,107232,191,0003,175,0002,658,304
5Jun 26, 2026 01:582,88886,662,423234,412,0001,010,0002,658,304
6Jun 26, 2026 01:582,89486,834,451230,765,0003,067,0002,662,400
7Jun 26, 2026 01:582,89786,924,413232,709,0003,107,0002,658,304
8Jun 26, 2026 01:582,90687,198,014232,715,0003,141,0002,662,400
9Jun 26, 2026 01:582,96588,965,363235,543,0002,061,0002,662,400