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 3, 2026 22:37olliecrowolliecrowScore: 71,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 22:3770,92453,116,23225,233,0001,009,0002,396,160
2Mar 3, 2026 22:3771,24150,163,81426,359,00002,277,376
3Mar 3, 2026 22:3771,24649,903,68926,361,00002,277,376