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 listOct 20, 2026 08:49e1011e1011Score: 160,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 08:51147,64865,960,62953,454,0001,176,0002,113,536
2Oct 20, 2026 08:51147,75465,582,89653,387,0001,282,0002,113,536
3Oct 20, 2026 08:51148,02165,684,93253,488,0001,280,0002,113,536
4Oct 20, 2026 08:51148,02766,180,01353,760,0001,010,0002,113,536
5Oct 20, 2026 08:51160,50870,240,72158,216,0001,172,0002,113,536
6Oct 20, 2026 08:51160,88670,430,12358,519,0001,009,0002,113,536
7Oct 20, 2026 08:51161,65171,236,23758,535,0001,276,0002,113,536
8Oct 20, 2026 08:51161,65470,682,14958,804,0001,008,0002,113,536
9Oct 20, 2026 08:51161,95971,379,97558,903,0001,022,0002,113,536