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 22:48Victor MerckléVictor MerckléScore: 71,148Success
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 22:4870,96235,416,38224,971,0001,285,0002,117,632stderr
2Jun 24, 2026 22:4871,01335,369,69424,996,0001,279,0002,117,632stderr
3Jun 24, 2026 22:4871,05135,399,78324,996,0001,293,0002,117,632stderr
4Jun 24, 2026 22:4871,05435,360,66325,012,0001,278,0002,117,632stderr
5Jun 24, 2026 22:4871,14835,413,86725,303,0001,022,0002,117,632stderr
6Jun 24, 2026 22:4871,25935,432,90025,344,0001,022,0002,117,632stderr
7Jun 24, 2026 22:4871,28335,466,85525,353,0001,022,0002,117,632stderr
8Jun 24, 2026 22:4871,41635,594,10225,399,0001,025,0002,117,632stderr
9Jun 24, 2026 22:4871,48335,516,30825,419,0001,030,0002,117,632stderr