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:26Karthik 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:270111,336,586100,552,0001,036,00040,960expected "1023392 ", got "343_8112_98709_100955_1_x2354_9116_100021_100314_1_x5349_5349_96290_100642_1_x100956_1023393_ "
2Oct 6, 2026 07:270111,716,324101,469,0001,013,00040,960expected "1019389 ", got "2913_5693_97022_101863_1_x306_10678_100923_101216_1_x4900_4900_95008_101553_1_x101864_1019390_ "
3Oct 6, 2026 07:270111,143,890100,874,0001,011,00040,960expected "1021147 ", got "3072_5854_98035_98328_1_x308_9841_97016_100924_1_x5060_5060_94925_101255_1_x101266_1021148_ "