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 listJan 13, 2026 00:44Josu San MartinJosu San MartinScore: 69,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 00:4468,64150,253,01625,397,00002,281,472
2Jan 13, 2026 00:4368,72451,169,30325,428,00002,281,472
3Jan 13, 2026 00:4468,82451,531,53625,465,00002,281,472
4Jan 13, 2026 00:4368,91152,374,56225,497,00002,347,008
5Jan 13, 2026 00:4469,08146,349,39225,560,00002,281,472
6Jan 13, 2026 00:4469,08650,677,07125,562,00002,351,104
7Jan 13, 2026 00:4469,10056,582,99825,567,00002,338,816
8Jan 13, 2026 00:4369,22247,529,04024,588,0001,024,0002,453,504
9Jan 13, 2026 00:44378,519161,442,598138,052,0002,000,0002,457,600