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 listMay 16, 2026 01:04M-RochatM-RochatScore: 110,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 01:05109,73249,317,76639,336,0001,265,0002,113,536
2May 16, 2026 01:05109,82749,729,32639,347,0001,289,0002,113,536
3May 16, 2026 01:05109,88349,370,57939,385,0001,272,0002,113,536
4May 16, 2026 01:05109,94049,594,95939,416,0001,262,0002,113,536
5May 16, 2026 01:05110,11049,802,29939,462,0001,279,0002,113,536
6May 16, 2026 01:05110,21050,495,19039,538,0001,240,0002,113,536
7May 16, 2026 01:05110,67851,152,03939,714,0001,237,0002,113,536
8May 16, 2026 01:05110,70050,063,51639,675,0001,284,0002,113,536
9May 16, 2026 01:05110,71051,066,81439,690,0001,273,0002,113,536