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 listJun 30, 2026 22:25IlyaIlyaScore: 21,485,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 22:2858,82431,268,34420,587,0001,178,0002,113,536
2Jun 30, 2026 22:2859,64032,057,81421,035,0001,032,0002,113,536
3Jun 30, 2026 22:2821,343,5327,906,799,9707,742,210,000154,897,0002,113,536
4Jun 30, 2026 22:2821,380,5567,920,857,8067,756,068,000154,738,0002,113,536
5Jun 30, 2026 22:2821,485,3247,959,418,5587,798,384,000151,186,0002,113,536
6Jun 30, 2026 22:2821,487,4007,960,297,4667,801,166,000149,172,0002,113,536
7Jun 30, 2026 22:2821,491,5677,961,543,0397,793,942,000157,938,0002,113,536
8Jun 30, 2026 22:2821,523,1677,973,179,5927,806,370,000157,202,0002,113,536
9Jun 30, 2026 22:2821,558,8277,986,442,8067,817,042,000159,724,0002,113,536