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 listJun 24, 2026 12:17Victor MerckléVictor MerckléScore: 68,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 12:1867,91832,581,10625,130,00002,113,536
2Jun 24, 2026 12:1868,02432,784,84125,169,00002,113,536
3Jun 24, 2026 12:1868,07532,802,82625,188,00002,113,536
4Jun 24, 2026 12:1868,15932,627,87325,219,00002,113,536
5Jun 24, 2026 12:1868,24032,632,54125,249,00002,113,536
6Jun 24, 2026 12:1868,41332,771,81625,313,00002,113,536
7Jun 24, 2026 12:1868,54832,785,96325,363,00002,113,536
8Jun 24, 2026 12:1868,64532,876,31725,399,00002,113,536
9Jun 24, 2026 12:1868,87032,957,86825,482,00002,113,536