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 21:35Victor MerckléVictor MerckléScore: 71,648Success
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 21:3671,50035,582,14525,166,0001,289,0002,113,536
2Jun 24, 2026 21:3671,50535,584,61225,436,0001,021,0002,113,536
3Jun 24, 2026 21:3671,50835,529,88625,179,0001,279,0002,113,536
4Jun 24, 2026 21:3671,60535,643,05625,473,0001,021,0002,113,536
5Jun 24, 2026 21:3671,64835,598,94325,489,0001,021,0002,113,536
6Jun 24, 2026 21:3671,72136,050,34425,514,0001,023,0002,113,536
7Jun 24, 2026 21:3671,82735,649,59525,285,0001,291,0002,113,536
8Jun 24, 2026 21:3671,82935,710,96325,556,0001,021,0002,113,536
9Jun 24, 2026 21:3671,87536,457,06025,572,0001,022,0002,113,536