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:57Victor MerckléVictor MerckléScore: 71,100Success
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:5870,95935,329,67124,996,0001,259,0002,113,536
2Jun 24, 2026 21:5870,97835,456,61924,995,0001,267,0002,113,536
3Jun 24, 2026 21:5871,01035,716,26825,010,0001,264,0002,113,536
4Jun 24, 2026 21:5871,08635,421,33525,038,0001,264,0002,113,536
5Jun 24, 2026 21:5871,10035,438,33025,034,0001,273,0002,113,536
6Jun 24, 2026 21:5871,12935,430,63725,061,0001,257,0002,113,536
7Jun 24, 2026 21:5871,34335,537,65525,136,0001,261,0002,113,536
8Jun 24, 2026 21:5871,38935,475,53225,139,0001,275,0002,113,536
9Jun 24, 2026 21:5871,40235,524,72425,152,0001,267,0002,113,536