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 11, 2026 23:11Victor MerckléVictor MerckléScore: 64,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 23:1264,31834,695,89822,774,0001,024,0002,113,536
2May 11, 2026 23:1264,53233,955,66822,801,0001,076,0002,113,536
3May 11, 2026 23:1264,55434,972,38622,803,0001,082,0002,113,536
4May 11, 2026 23:1264,63234,470,46922,836,0001,078,0002,113,536
5May 11, 2026 23:1264,70532,703,01822,834,0001,107,0002,113,536
6May 11, 2026 23:1264,70834,671,29122,850,0001,092,0002,113,536
7May 11, 2026 23:1264,80834,460,87022,963,0001,016,0002,113,536
8May 11, 2026 23:1265,06234,306,23922,975,0001,098,0002,113,536
9May 11, 2026 23:1265,15934,978,84122,995,0001,114,0002,113,536