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 22, 2026 21:14olliecrowolliecrowScore: 60,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 16:4259,98948,218,00621,188,0001,008,0002,273,280
2Mar 13, 2026 16:3760,16544,536,35121,250,0001,011,0002,400,256
3Mar 13, 2026 16:4260,18444,887,67721,256,0001,012,0002,273,280
4Mar 13, 2026 16:3760,25749,438,05321,282,0001,013,0002,396,160
5Mar 22, 2026 21:1460,41444,609,24721,337,0001,016,0002,392,064
6Mar 13, 2026 16:4260,45143,730,69622,367,00002,506,752
7Mar 22, 2026 21:1460,46253,289,95620,338,0002,033,0002,281,472
8Mar 13, 2026 16:3760,49742,080,92821,367,0001,017,0002,273,280
9Mar 22, 2026 21:1460,58149,334,77121,397,0001,018,0002,400,256