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 listOct 31, 2026 03:54Andrew EpsteinAndrew EpsteinScore: 1,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 03:541,46844,058,710100,784,0001,165,0002,166,784
2Oct 31, 2026 03:541,47244,186,377101,229,0001,200,0002,166,784
3Oct 31, 2026 03:541,48244,477,225102,154,0001,149,0002,166,784
4Oct 31, 2026 03:541,49044,714,691103,256,0001,193,0002,166,784
5Oct 31, 2026 03:541,49844,959,797103,730,0001,164,0002,158,592
6Oct 31, 2026 03:541,49944,995,059103,942,0001,049,0002,166,784
7Oct 31, 2026 03:541,50745,238,016103,635,0002,181,0002,166,784
8Oct 31, 2026 03:541,52145,634,951105,371,0001,130,0002,166,784
9Oct 31, 2026 03:541,53245,976,107102,436,0001,067,0002,166,784