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 24, 2026 20:44janwwwjanwwwScore: 5,549Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 20:475,451163,534,349441,431,0004,118,0002,187,264
2Oct 24, 2026 20:475,473164,205,856445,339,0004,340,0002,187,264
3Oct 24, 2026 20:475,514165,448,656447,673,0004,195,0002,187,264
4Oct 24, 2026 20:475,547166,412,476449,937,0004,198,0002,183,168
5Oct 24, 2026 20:475,549166,491,223449,737,0004,337,0002,187,264
6Oct 24, 2026 20:475,552166,577,260449,732,0004,219,0002,183,168
7Oct 24, 2026 20:475,560166,808,745450,032,0004,361,0002,187,264
8Oct 24, 2026 20:475,561166,830,385451,142,0004,406,0002,183,168
9Oct 24, 2026 20:475,573167,204,032450,981,0004,372,0002,187,264