TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listMar 21, 2026 15:02izotoffizotoffScore: 115,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 15:02115,28973,061,64140,626,0002,031,0002,330,624
2Mar 21, 2026 15:02115,41671,300,96141,688,0001,016,0002,330,624
3Mar 21, 2026 15:02115,64670,315,92940,799,0001,990,0002,326,528
4Mar 21, 2026 15:02115,71668,973,38741,820,000995,0002,334,720
5Mar 21, 2026 15:02115,76568,839,64641,837,000996,0002,322,432
6Mar 21, 2026 15:02115,77070,031,67941,839,000996,0002,322,432
7Mar 21, 2026 15:02116,38171,309,26241,059,0002,002,0002,334,720
8Mar 21, 2026 15:02116,57667,685,24541,127,0002,006,0002,322,432
9Mar 21, 2026 15:02117,21467,211,13841,352,0002,017,0002,334,720