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 listMar 20, 2026 05:39olliecrowolliecrowScore: 7,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 05:396,785203,560,142497,448,0009,968,0002,682,880
2Mar 20, 2026 05:396,882206,453,538492,601,0009,971,0002,428,928
3Mar 20, 2026 05:396,888206,626,245502,299,00011,006,0002,584,576
4Mar 20, 2026 05:396,962208,859,733493,596,0008,992,0002,666,496
5Mar 20, 2026 05:397,003210,082,547501,545,0009,990,0002,826,240
6Mar 20, 2026 05:397,008210,243,883493,052,00010,978,0002,666,496
7Mar 20, 2026 05:397,022210,660,832504,687,0008,976,0002,383,872
8Mar 20, 2026 05:397,137214,119,292503,512,0009,990,0002,412,544
9Mar 20, 2026 05:397,259217,755,111503,531,00010,968,0002,650,112