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 7, 2026 02:27Victor MerckléVictor MerckléScore: 64,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 02:2863,69132,621,38922,513,0001,053,0002,113,536
2Jun 7, 2026 02:2863,85432,693,38922,574,0001,052,0002,113,536
3Jun 7, 2026 02:2863,93532,731,00022,588,0001,068,0002,113,536
4Jun 7, 2026 02:2863,93732,703,02622,531,0001,126,0002,113,536
5Jun 7, 2026 02:2864,04532,751,52422,553,0001,144,0002,113,536
6Jun 7, 2026 02:2864,27832,898,94022,683,0001,100,0002,113,536
7Jun 7, 2026 02:2864,52433,018,47422,714,0001,160,0002,113,536
8Jun 7, 2026 02:2864,59135,415,08622,734,0001,165,0002,113,536
9Jun 7, 2026 02:2864,73733,045,27422,875,0001,078,0002,113,536