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 listMar 22, 2026 19:35Dominique GarmierDominique GarmierScore: 858,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 17:43854,832335,182,369315,288,0001,000,0002,273,280
2Mar 22, 2026 19:35856,316340,929,997314,839,0001,998,0002,277,376
3Mar 22, 2026 17:43858,665344,668,976316,707,000999,0002,277,376
4Mar 22, 2026 17:43858,724339,460,908315,730,0001,998,0002,473,984
5Mar 22, 2026 19:35859,938343,149,893317,177,0001,000,0002,482,176
6Mar 22, 2026 19:35862,119341,244,243316,985,0001,999,0002,473,984