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 25, 2026 08:27Victor MerckléVictor MerckléScore: 93,872Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 08:2793,47242,190,65234,585,00002,117,632stderr
2Jun 25, 2026 08:2793,57542,207,41433,609,0001,014,0002,117,632stderr
3Jun 25, 2026 08:2793,72442,264,32634,678,00002,117,632stderr
4Jun 25, 2026 08:2793,78642,312,34433,679,0001,022,0002,117,632stderr
5Jun 25, 2026 08:2793,87242,191,09033,706,0001,027,0002,117,632stderr
6Jun 25, 2026 08:2793,90542,358,10533,663,0001,082,0002,117,632stderr
7Jun 25, 2026 08:2793,97843,126,63133,739,0001,033,0002,117,632stderr
8Jun 25, 2026 08:2793,99742,419,19833,755,0001,024,0002,117,632stderr
9Jun 25, 2026 08:2794,01042,461,51733,750,0001,034,0002,117,632stderr