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 16, 2026 16:53olliecrowolliecrowScore: 548,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 16:53545,368229,561,29727,970,000173,816,0002,338,816
2Apr 16, 2026 16:53548,838232,560,00028,009,000175,061,0002,367,488
3Apr 16, 2026 16:53561,424229,083,23627,963,000179,764,0002,371,584