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 07:34Andrew EpsteinAndrew EpsteinScore: 1,559Success
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 07:431,54946,493,383100,950,0002,035,0002,179,072stderr
2Oct 31, 2026 07:431,55046,514,801101,293,0002,048,0002,179,072stderr
3Oct 31, 2026 07:431,55146,544,148101,336,0002,045,0002,183,168stderr
4Oct 31, 2026 07:431,55446,636,650101,763,0002,011,0002,179,072stderr
5Oct 31, 2026 07:431,55946,773,607101,670,0002,050,0002,179,072stderr
6Oct 31, 2026 07:431,57747,321,078103,994,0002,019,0002,179,072stderr
7Oct 31, 2026 07:431,59947,981,381105,234,0002,032,0002,183,168stderr
8Oct 31, 2026 07:431,60348,100,889103,113,0002,271,0002,224,128stderr
9Oct 31, 2026 07:431,61848,550,367102,664,0002,015,0002,183,168stderr