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 listAug 28, 2026 16:15Victor MerckléVictor MerckléScore: 56,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 16:1756,44529,922,71719,852,0001,033,0002,113,536
2Aug 28, 2026 16:1756,47529,924,06019,886,0001,010,0002,113,536
3Aug 28, 2026 16:1756,52729,995,79819,910,0001,005,0002,113,536
4Aug 28, 2026 16:1756,54529,980,49219,919,0001,003,0002,113,536
5Aug 28, 2026 16:1756,56729,968,05919,890,0001,040,0002,113,536
6Aug 28, 2026 16:1756,65929,325,70719,926,0001,038,0002,113,536
7Aug 28, 2026 16:1756,69429,098,82119,944,0001,033,0002,113,536
8Aug 28, 2026 16:1756,89129,694,22220,030,0001,020,0002,113,536
9Aug 28, 2026 16:1757,13730,592,34120,092,0001,049,0002,113,536