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 8, 2026 00:52Victor MerckléVictor MerckléScore: 157,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 00:53153,85470,095,22610,786,00046,140,0002,113,536
2Jun 8, 2026 00:53156,48969,325,26311,766,00046,135,0002,113,536
3Jun 8, 2026 00:53156,91067,336,44011,713,00046,344,0002,113,536
4Jun 8, 2026 00:53157,02167,191,93810,863,00047,235,0002,113,536
5Jun 8, 2026 00:53157,76767,561,35311,581,00046,793,0002,113,536
6Jun 8, 2026 00:53158,27867,658,71210,905,00047,658,0002,113,536
7Jun 8, 2026 00:53158,65667,820,60211,820,00046,883,0002,113,536
8Jun 8, 2026 00:53158,82469,115,29411,752,00047,013,0002,113,536
9Jun 8, 2026 00:53163,15179,546,16013,305,00047,061,0002,113,536