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 05:26olliecrowolliecrowScore: 60,905Success
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 05:2660,82238,904,36021,482,0001,022,0002,506,752
2Apr 16, 2026 05:2660,90547,458,82622,535,00002,289,664
3Apr 16, 2026 05:2661,13851,623,56521,593,0001,028,0002,383,872