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:48Andrew EpsteinAndrew EpsteinScore: 1,554Success
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:521,54246,278,445101,051,0002,009,0002,183,168stderr
2Oct 31, 2026 08:521,54846,457,185101,108,0002,012,0002,179,072stderr
3Oct 31, 2026 08:521,55246,582,601101,619,0002,008,0002,183,168stderr
4Oct 31, 2026 08:521,55446,637,186102,146,0002,004,0002,179,072stderr
5Oct 31, 2026 08:521,55446,627,016102,811,0001,010,0002,179,072stderr
6Oct 31, 2026 08:521,55646,703,877101,574,0002,016,0002,179,072stderr
7Oct 31, 2026 08:521,55846,752,358102,221,0002,013,0002,183,168stderr
8Oct 31, 2026 08:521,56646,981,071102,698,0002,016,0002,183,168stderr
9Oct 31, 2026 08:521,56947,070,266103,253,0002,031,0002,183,168stderr