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 9, 2026 18:14olliecrowolliecrowScore: 60,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2026 18:1460,87046,059,16722,522,00002,502,656
2Apr 9, 2026 18:1460,94643,448,77621,525,0001,025,0002,498,560
3Apr 9, 2026 18:1460,97650,901,39222,561,00002,285,568