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 27, 2026 13:04Victor MerckléVictor MerckléScore: 2,904Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 13:052,86986,080,906230,026,0003,232,0002,658,304
2Jun 27, 2026 13:052,87286,163,283230,050,0003,205,0002,658,304
3Jun 27, 2026 13:052,88186,447,455231,292,0003,190,0002,658,304
4Jun 27, 2026 13:052,89886,962,033232,368,0003,205,0002,658,304
5Jun 27, 2026 13:052,90487,120,949233,147,0003,146,0002,658,304
6Jun 27, 2026 13:052,94588,370,639232,645,0003,157,0002,658,304
7Jun 27, 2026 13:052,96789,013,754233,069,0003,429,0002,658,304
8Jun 27, 2026 13:052,98089,421,103234,257,0003,190,0002,658,304
9Jun 27, 2026 13:052,98189,431,228235,180,0003,138,0002,654,208