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 12, 2026 04:07olliecrowolliecrowScore: 60,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 04:0760,36249,096,23221,319,0001,015,0002,273,280
2Mar 12, 2026 04:0760,65144,509,31121,421,0001,020,0002,273,280
3Mar 12, 2026 04:0760,89246,125,37921,506,0001,024,0002,400,256