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 listApr 20, 2026 14:34olliecrowolliecrowScore: 543,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 14:35543,202223,639,06626,998,000173,987,0002,392,064
2Apr 20, 2026 14:35543,794226,703,60727,027,000174,177,0002,342,912
3Apr 20, 2026 14:35550,829217,434,96426,974,000176,833,0002,265,088