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 13:06Dominique GarmierDominique GarmierError
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 13:07053,419,11125,839,000993,0002,383,872expected "429496493311 ", got "289281442102 "
2Apr 20, 2026 13:07054,614,11625,054,0002,004,0002,379,776expected "429496508553 ", got "257766210815 "
3Apr 20, 2026 13:07058,578,96725,010,0002,000,0002,379,776expected "429496514987 ", got "253420001501 "