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 28, 2026 08:12TudyMTudyMScore: 101,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:12101,02956,421,70236,371,0001,010,0002,379,776
2Apr 28, 2026 08:12101,27853,610,02736,461,0001,012,0002,363,392
3Apr 28, 2026 08:12101,37560,910,02436,496,0001,013,0002,363,392
4Apr 28, 2026 08:12101,53757,212,18936,554,0001,015,0002,371,584
5Apr 28, 2026 08:12101,61654,900,49635,566,0002,032,0002,371,584
6Apr 28, 2026 08:12101,68151,086,26336,606,0001,016,0002,375,680
7Apr 28, 2026 08:12102,01054,916,03434,765,0002,979,0002,371,584
8Apr 28, 2026 08:12102,38963,427,93135,891,0001,993,0002,371,584
9Apr 28, 2026 08:12102,61852,739,87834,972,0002,997,0002,371,584