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 25, 2026 17:15Dominique GarmierDominique GarmierScore: 103,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 17:15102,66262,584,99635,986,0001,999,0002,277,376
2Mar 25, 2026 17:15103,33864,672,25936,223,0002,012,0002,473,984
3Mar 25, 2026 17:15103,41160,591,57336,249,0002,013,0002,478,080