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 11, 2026 14:41Victor MerckléVictor MerckléScore: 3,109Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 14:423,08692,608,656242,639,0001,027,0002,654,208
2Jun 11, 2026 14:423,08792,636,463242,888,0001,007,0002,654,208
3Jun 11, 2026 14:423,09292,776,172242,639,0001,006,0002,650,112
4Jun 11, 2026 14:423,10093,026,823243,099,0001,029,0002,654,208
5Jun 11, 2026 14:423,10993,290,320244,973,0001,012,0002,650,112
6Jun 11, 2026 14:423,12193,646,207245,990,0001,036,0002,650,112
7Jun 11, 2026 14:423,12593,752,156247,568,0001,018,0002,654,208
8Jun 11, 2026 14:423,12893,861,029243,961,0001,004,0002,650,112
9Jun 11, 2026 14:423,14494,337,467244,144,0001,006,0002,646,016