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:02Andrew EpsteinAndrew EpsteinScore: 1,512Success
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:041,47544,251,188101,111,0001,146,0002,158,592
2Oct 31, 2026 03:041,48344,508,287101,602,0001,231,0002,166,784
3Oct 31, 2026 03:041,50245,071,161103,726,0001,103,0002,166,784
4Oct 31, 2026 03:041,50745,216,817104,225,0001,135,0002,166,784
5Oct 31, 2026 03:041,51245,369,117104,717,0001,174,0002,166,784
6Oct 31, 2026 03:041,52045,601,067105,361,0001,152,0002,158,592
7Oct 31, 2026 03:041,53045,928,159106,121,0001,149,0002,166,784
8Oct 31, 2026 03:041,53346,019,915106,577,0001,188,0002,166,784
9Oct 31, 2026 03:041,55146,531,562108,413,0001,259,0002,166,784