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:03Andrew EpsteinAndrew EpsteinScore: 1,507Success
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:111,48244,489,507102,071,0001,014,0002,170,880
2Oct 31, 2026 03:111,48844,642,219102,649,0001,012,0002,170,880
3Oct 31, 2026 03:111,49144,741,526100,511,0003,270,0002,170,880
4Oct 31, 2026 03:111,49544,879,644103,784,0001,034,0002,170,880
5Oct 31, 2026 03:111,50745,236,784105,017,0001,011,0002,170,880
6Oct 31, 2026 03:111,50945,288,407104,470,0001,024,0002,170,880
7Oct 31, 2026 03:111,51045,301,014103,639,0002,035,0002,162,688
8Oct 31, 2026 03:111,51845,562,688105,467,0001,011,0002,170,880
9Oct 31, 2026 03:111,53245,981,328106,867,0001,020,0002,162,688