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 20, 2026 18:55olliecrowolliecrowScore: 102,303Success
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 18:49100,68660,924,83935,241,0002,013,0002,326,528
2Mar 20, 2026 18:55100,72462,482,69735,254,0002,014,0002,445,312
3Mar 20, 2026 18:53100,98656,257,50334,336,0003,029,0002,342,912
4Mar 20, 2026 18:54101,47057,863,52735,515,0002,029,0002,342,912
5Mar 20, 2026 18:49102,26262,753,09934,850,0002,987,0002,342,912
6Mar 20, 2026 18:54102,27062,651,91336,845,000995,0002,342,912
7Mar 20, 2026 18:53102,30364,147,82434,864,0002,988,0002,453,504
8Mar 20, 2026 18:55102,34662,665,32433,882,0003,986,0002,428,928
9Mar 20, 2026 18:53103,00365,910,78135,103,0003,008,0002,433,024
10Mar 20, 2026 18:49103,04369,545,41335,116,0003,010,0002,342,912
11Mar 20, 2026 18:55103,13065,132,85936,150,0002,008,0002,342,912
12Mar 20, 2026 18:54104,20360,127,97536,526,0002,029,0002,347,008