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 11:07Victor MerckléVictor MerckléScore: 63,824Success
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 11:0863,50830,996,95922,442,0001,056,0002,113,536
2Jun 24, 2026 11:0863,59130,977,26422,473,0001,056,0002,113,536
3Jun 24, 2026 11:0863,62930,987,12222,491,0001,052,0002,113,536
4Jun 24, 2026 11:0863,68131,006,35122,498,0001,064,0002,113,536
5Jun 24, 2026 11:0863,82431,430,67122,521,0001,094,0002,113,536
6Jun 24, 2026 11:0863,92731,106,91122,529,0001,124,0002,113,536
7Jun 24, 2026 11:0864,16231,176,90522,682,0001,058,0002,113,536
8Jun 24, 2026 11:0864,52933,378,15022,822,0001,054,0002,113,536
9Jun 24, 2026 11:08622,432240,029,507229,216,0001,084,0002,113,536