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 listApr 26, 2026 13:15olliecrowolliecrowScore: 62,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 13:1662,10845,392,26919,983,0002,997,0002,510,848
2Apr 26, 2026 13:1662,33237,733,14520,055,0003,008,0002,506,752
3Apr 26, 2026 13:1662,35142,790,10920,061,0003,009,0002,514,944
4Apr 26, 2026 13:1662,42143,068,26420,084,0003,012,0002,494,464
5Apr 26, 2026 13:1662,50843,231,70320,112,0003,016,0002,510,848
6Apr 26, 2026 13:1662,54040,129,25920,122,0003,018,0002,338,816
7Apr 26, 2026 13:1662,64036,740,06220,154,0003,023,0002,506,752
8Apr 26, 2026 13:1662,65944,686,70320,160,0003,024,0002,514,944
9Apr 26, 2026 13:1662,86745,248,96720,227,0003,034,0002,506,752