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 08:06Andrew EpsteinAndrew EpsteinScore: 1,556Success
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 08:181,54146,237,234100,284,0002,051,0002,183,168stderr
2Oct 31, 2026 08:181,54346,292,562100,677,0002,004,0002,179,072stderr
3Oct 31, 2026 08:181,55446,620,795101,691,0002,018,0002,179,072stderr
4Oct 31, 2026 08:181,55446,628,373101,253,0002,016,0002,179,072stderr
5Oct 31, 2026 08:181,55646,686,761101,613,0002,035,0002,179,072stderr
6Oct 31, 2026 08:181,56046,828,497103,358,0001,009,0002,179,072stderr
7Oct 31, 2026 08:181,57147,145,510102,951,0002,156,0002,183,168stderr
8Oct 31, 2026 08:181,59247,760,138104,743,0002,036,0002,179,072stderr
9Oct 31, 2026 08:182,17565,254,951123,620,0002,087,0002,179,072stderr