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:11Andrew EpsteinAndrew EpsteinScore: 1,473Success
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:161,44143,242,04199,057,0001,181,0002,150,400stderr
2Oct 31, 2026 07:161,44443,338,36899,246,0001,182,0002,154,496stderr
3Oct 31, 2026 07:161,44643,407,36299,460,0001,179,0002,150,400stderr
4Oct 31, 2026 07:161,47144,138,175101,755,0001,038,0002,150,400stderr
5Oct 31, 2026 07:161,47344,195,018101,815,0001,218,0002,154,496stderr
6Oct 31, 2026 07:161,48944,679,319103,377,0001,029,0002,150,400stderr
7Oct 31, 2026 07:161,49344,793,624103,794,0001,010,0002,150,400stderr
8Oct 31, 2026 07:161,49844,968,984104,265,0001,028,0002,150,400stderr
9Oct 31, 2026 07:161,50945,276,133105,287,0001,037,0002,154,496stderr