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 20:54olliecrowolliecrowScore: 60,981Success
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 20:5460,85444,925,47622,516,00002,285,568
2Apr 16, 2026 20:5460,98153,555,60421,538,0001,025,0002,502,656
3Apr 16, 2026 20:5461,07353,001,36621,570,0001,027,0002,285,568