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 05:44Andrew EpsteinAndrew EpsteinScore: 1,571Success
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 05:511,54146,256,476100,493,0002,048,0002,174,976stderr
2Oct 31, 2026 05:511,56847,058,982103,164,0002,013,0002,174,976stderr
3Oct 31, 2026 05:511,56847,066,623104,296,0001,010,0002,174,976stderr
4Oct 31, 2026 05:511,56947,079,882102,886,0002,120,0002,179,072stderr
5Oct 31, 2026 05:511,57147,136,481102,774,0002,019,0002,179,072stderr
6Oct 31, 2026 05:511,57247,161,886102,822,0002,042,0002,174,976stderr
7Oct 31, 2026 05:511,57347,210,213103,423,0002,003,0002,179,072stderr
8Oct 31, 2026 05:511,57747,338,034103,456,0002,094,0002,174,976stderr
9Oct 31, 2026 05:512,09162,740,200114,740,0002,104,0002,174,976stderr