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 09:12Andrew EpsteinAndrew EpsteinError
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 09:23046,072,10399,883,0002,037,0002,179,072expected "1022680 ", got "1022679 "stderr
2Oct 31, 2026 09:231,51345,417,48697,950,0002,032,0002,191,360stderr
3Oct 31, 2026 09:231,53646,090,419100,392,0002,017,0002,179,072stderr
4Oct 31, 2026 09:231,54246,274,091100,839,0002,019,0002,195,456stderr
5Oct 31, 2026 09:231,54446,331,449101,913,0001,010,0002,179,072stderr
6Oct 31, 2026 09:231,55246,588,017102,881,0001,009,0002,179,072stderr
7Oct 31, 2026 09:231,55746,737,566102,379,0002,012,0002,179,072stderr
8Oct 31, 2026 09:231,59747,924,340100,469,0002,017,0002,179,072stderr
9Oct 31, 2026 09:232,05861,744,716117,028,0002,172,0002,195,456stderr