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:09Victor MerckléVictor MerckléScore: 64,062Success
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:1063,87532,799,16822,577,0001,057,0002,113,536
2Jun 7, 2026 02:1063,92432,705,57022,521,0001,131,0002,113,536
3Jun 7, 2026 02:1063,95632,790,32922,541,0001,123,0002,113,536
4Jun 7, 2026 02:1063,96432,742,07622,528,0001,139,0002,113,536
5Jun 7, 2026 02:1064,06232,816,41822,569,0001,134,0002,113,536
6Jun 7, 2026 02:1064,15432,929,46922,592,0001,145,0002,113,536
7Jun 7, 2026 02:1064,44332,954,66022,701,0001,143,0002,113,536
8Jun 7, 2026 02:1064,47032,986,83222,712,0001,142,0002,113,536
9Jun 7, 2026 02:1064,50532,993,73622,728,0001,139,0002,113,536