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 9, 2026 08:26Karthik ReddyKarthik ReddyScore: 53,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 09:4253,6456,029,041,15719,849,000020,480
2Oct 9, 2026 09:4253,7026,029,134,55219,870,000020,480
3Oct 9, 2026 09:4253,7356,029,078,11619,882,000020,480
4Oct 9, 2026 09:4253,9106,030,774,12619,947,000020,480
5Oct 9, 2026 09:4253,9106,029,140,65419,947,000020,480
6Oct 9, 2026 09:4253,9486,029,199,51919,961,000020,480
7Oct 9, 2026 09:4254,0356,029,095,93419,993,000020,480
8Oct 9, 2026 09:4254,0976,029,254,74620,016,000020,480
9Oct 9, 2026 09:4254,1486,029,446,57120,035,000020,480