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 23:03Victor MerckléVictor MerckléScore: 71,108Success
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 23:0370,90535,301,94724,946,0001,289,0002,117,632stderr
2Jun 24, 2026 23:0370,99435,344,71724,997,0001,271,0002,117,632stderr
3Jun 24, 2026 23:0371,08335,399,69525,009,0001,292,0002,117,632stderr
4Jun 24, 2026 23:0371,10535,403,50225,020,0001,289,0002,117,632stderr
5Jun 24, 2026 23:0371,10835,366,64125,036,0001,274,0002,117,632stderr
6Jun 24, 2026 23:0371,25435,510,18625,344,0001,020,0002,117,632stderr
7Jun 24, 2026 23:0371,27035,424,98825,091,0001,279,0002,117,632stderr
8Jun 24, 2026 23:0371,38135,536,32325,119,0001,292,0002,117,632stderr
9Jun 24, 2026 23:0371,56735,604,87525,450,0001,030,0002,117,632stderr