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:34olliecrowolliecrowScore: 85,089Success
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:3484,30857,545,37829,182,0002,012,0002,396,160
2Mar 3, 2026 22:3485,08952,301,83231,483,00002,387,968
3Mar 3, 2026 22:3485,35751,737,17730,564,0001,018,0002,387,968