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 listFeb 11, 2026 07:01MMisMMisScore: 107,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 07:01107,65170,095,87738,836,000995,0002,523,136
2Feb 11, 2026 07:01107,70563,867,60237,859,0001,992,0002,519,040
3Feb 11, 2026 07:01107,74173,769,29337,871,0001,993,0002,519,040
4Feb 11, 2026 07:01107,81464,418,60037,846,0002,045,0002,269,184
5Feb 11, 2026 07:01107,84165,413,92639,901,00002,269,184
6Feb 11, 2026 07:01107,89767,104,22037,926,0001,996,0002,523,136
7Feb 11, 2026 07:01108,46565,657,59338,126,0002,006,0002,519,040
8Feb 11, 2026 07:01108,81465,744,13638,248,0002,013,0002,527,232
9Feb 11, 2026 07:01109,33267,437,33539,442,0001,011,0002,277,376