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:06Andrew EpsteinAndrew EpsteinScore: 1,547Success
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:111,53946,185,605101,716,0001,009,0002,183,168stderr
2Oct 31, 2026 09:111,54246,274,545100,602,0002,025,0002,183,168stderr
3Oct 31, 2026 09:111,54446,328,984101,871,0001,009,0002,179,072stderr
4Oct 31, 2026 09:111,54646,395,651101,280,0002,019,0002,183,168stderr
5Oct 31, 2026 09:111,54746,415,728101,216,0002,009,0002,179,072stderr
6Oct 31, 2026 09:111,55546,662,499101,779,0002,011,0002,179,072stderr
7Oct 31, 2026 09:111,55946,792,601102,083,0002,019,0002,179,072stderr
8Oct 31, 2026 09:111,59947,973,072102,879,0001,010,0002,179,072stderr
9Oct 31, 2026 09:112,12263,687,241115,968,0002,110,0002,179,072stderr