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 7, 2026 04:05Victor MerckléVictor MerckléScore: 3,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 04:063,13594,061,734246,460,0001,151,0002,146,304
2Jun 7, 2026 04:063,15794,719,135248,460,0001,007,0002,142,208
3Jun 7, 2026 04:063,16795,020,300246,211,0001,140,0002,146,304
4Jun 7, 2026 04:063,20196,042,615249,897,0002,173,0002,142,208
5Jun 7, 2026 04:063,20596,179,235251,476,0002,175,0002,142,208
6Jun 7, 2026 04:063,20696,204,562249,799,0002,156,0002,142,208
7Jun 7, 2026 04:063,20896,242,545248,443,0002,296,0002,146,304
8Jun 7, 2026 04:063,21296,376,879252,234,0001,053,0002,142,208
9Jun 7, 2026 04:063,24597,357,598251,969,0002,219,0002,142,208