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 04:25Andrew EpsteinAndrew EpsteinScore: 1,538Success
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 04:261,49744,912,169103,513,0001,069,0002,166,784
2Oct 31, 2026 04:261,50145,052,278103,587,0001,162,0002,166,784
3Oct 31, 2026 04:261,51345,407,617104,511,0001,229,0002,166,784
4Oct 31, 2026 04:261,52445,743,575105,000,0001,215,0002,166,784
5Oct 31, 2026 04:261,53846,162,772106,783,0001,095,0002,166,784
6Oct 31, 2026 04:261,56046,828,228104,434,0001,033,0002,166,784
7Oct 31, 2026 04:261,74652,392,599112,412,0001,120,0002,166,784
8Oct 31, 2026 04:261,77853,369,584115,172,0001,015,0002,166,784
9Oct 31, 2026 04:261,93758,128,275112,310,0003,032,0002,166,784