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 21, 2026 14:36Dominique GarmierDominique GarmierScore: 1,938,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 14:361,936,535742,523,689714,520,0001,998,0002,359,296
2Mar 21, 2026 14:361,938,262737,761,661716,157,0001,000,0002,285,568
3Mar 21, 2026 14:361,939,927741,074,202715,774,0001,999,0002,363,392