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 4, 2026 04:32olliecrowolliecrowScore: 69,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 04:3269,29246,852,88625,638,00002,396,160
2Mar 4, 2026 04:3269,89550,505,93823,872,0001,989,0002,396,160
3Mar 4, 2026 04:3270,33852,272,47826,025,00002,277,376