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 6, 2026 07:32Karthik ReddyKarthik ReddyError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 07:32046,894,505108,064,0000466,944expected "1019394 ", got "329_2384_36471_37138_1_x2368_2384_36804_37139_2_x2384_2384_36843_37139_3_x37140_1019395_ "
2Oct 6, 2026 07:32046,790,915107,339,0000458,752expected "1021836 ", got "319_2719_36679_37121_1_x2708_2719_36823_37120_2_x2719_2719_36683_37120_3_x37121_1021837_ "
3Oct 6, 2026 07:32047,406,313111,010,0000462,848expected "1026269 ", got "363_2951_37343_37642_1_x365_2951_37035_37641_2_x2951_2951_37225_37641_3_x37643_1026270_ "