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 9, 2026 23:27Victor MerckléVictor MerckléScore: 3,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 23:283,13794,129,818247,260,0002,276,0002,138,112
2Jun 9, 2026 23:283,17795,312,930249,158,0002,297,0002,142,208
3Jun 9, 2026 23:283,18995,691,072245,158,0003,017,0002,142,208
4Jun 9, 2026 23:283,19495,832,390249,761,0002,274,0002,142,208
5Jun 9, 2026 23:283,20096,003,867249,556,0002,244,0002,138,112
6Jun 9, 2026 23:283,21896,542,652247,071,0003,041,0002,404,352
7Jun 9, 2026 23:283,22996,897,213252,973,0002,145,0002,146,304
8Jun 9, 2026 23:283,23597,055,388253,108,0002,280,0002,138,112
9Jun 9, 2026 23:283,25297,582,922250,735,0003,026,0002,142,208