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 13, 2026 06:29olliecrowolliecrowScore: 60,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 06:2959,97650,633,08320,174,0002,017,0002,273,280
2Mar 13, 2026 06:2960,05941,649,71021,212,0001,010,0002,273,280
3Mar 13, 2026 06:2960,12750,208,78120,225,0002,022,0002,400,256
4Mar 13, 2026 06:2960,13246,779,98220,227,0002,022,0002,273,280
5Mar 13, 2026 06:2960,18446,851,10620,244,0002,024,0002,404,352
6Mar 13, 2026 06:2960,20848,175,09420,252,0002,025,0002,400,256
7Mar 13, 2026 06:2960,45150,078,71820,334,0002,033,0002,396,160
8Mar 13, 2026 06:2960,58949,781,95721,399,0001,019,0002,400,256
9Mar 13, 2026 06:2960,66847,809,21522,447,00002,514,944