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 5, 2026 15:04Victor MerckléVictor MerckléScore: 5,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 15:055,208156,251,580429,691,0008,141,0002,596,864
2Jun 5, 2026 15:055,222156,685,192429,541,0007,911,0002,605,056
3Jun 5, 2026 15:055,230156,904,902431,833,0007,898,0002,600,960
4Jun 5, 2026 15:055,233157,015,882432,458,0006,892,0002,596,864
5Jun 5, 2026 15:055,297158,913,720429,207,0009,016,0002,605,056
6Jun 5, 2026 15:055,304159,136,647434,747,00010,064,0002,600,960
7Jun 5, 2026 15:055,338160,154,146438,187,0007,716,0002,600,960
8Jun 5, 2026 15:055,356160,708,334438,677,0009,719,0002,596,864
9Jun 5, 2026 15:055,372161,162,746441,891,0008,944,0002,596,864