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 18, 2026 17:31Victor MerckléVictor MerckléScore: 3,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 17:323,08092,410,708243,522,0001,013,0002,654,208
2Jun 18, 2026 17:323,09692,886,603242,073,0001,010,0002,654,208
3Jun 18, 2026 17:323,10493,149,222245,892,0001,009,0002,650,112
4Jun 18, 2026 17:323,12893,840,838243,933,0003,173,0002,392,064
5Jun 18, 2026 17:323,13293,983,005248,948,0001,028,0002,654,208
6Jun 18, 2026 17:323,13794,124,812247,848,0001,010,0002,654,208
7Jun 18, 2026 17:323,14094,228,099242,351,0003,036,0002,654,208
8Jun 18, 2026 17:323,16795,010,416244,936,0001,029,0002,650,112
9Jun 18, 2026 17:323,19995,974,487250,768,00002,654,208