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 12:38Dominique GarmierDominique GarmierScore: 72,291Success
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 12:3871,26249,188,45625,353,0001,014,0002,367,488
2Apr 20, 2026 12:3872,29145,315,18225,758,000990,0002,273,280
3Apr 20, 2026 12:3872,72145,506,28324,914,0001,993,0002,256,896