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 05:21Andrew EpsteinAndrew EpsteinScore: 1,503Success
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 05:261,47944,390,933101,527,0001,162,0002,166,784
2Oct 31, 2026 05:261,48944,694,325102,703,0001,160,0002,166,784
3Oct 31, 2026 05:261,49344,799,704102,869,0001,166,0002,166,784
4Oct 31, 2026 05:261,49444,826,323102,850,0001,228,0002,166,784
5Oct 31, 2026 05:261,50345,103,624104,003,0001,105,0002,166,784
6Oct 31, 2026 05:261,51645,482,828105,066,0001,130,0002,166,784
7Oct 31, 2026 05:261,71351,419,703118,071,0002,025,0002,166,784
8Oct 31, 2026 05:261,74552,379,918102,787,0001,181,0002,170,880
9Oct 31, 2026 05:261,95758,713,827110,615,0003,043,0002,170,880