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 15:01olliecrowolliecrowScore: 60,257Success
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 15:0159,94647,316,73120,164,0002,016,0002,273,280
2Mar 13, 2026 15:0159,94642,607,73120,164,0002,016,0002,400,256
3Mar 13, 2026 15:0160,21647,740,75620,255,0002,025,0002,273,280
4Mar 13, 2026 15:0160,24352,357,93620,264,0002,026,0002,396,160
5Mar 13, 2026 15:0160,25745,269,11620,269,0002,026,0002,273,280
6Mar 13, 2026 15:0160,36849,862,27521,321,0001,015,0002,273,280
7Mar 13, 2026 15:0160,45750,558,23120,336,0002,033,0002,273,280
8Mar 13, 2026 15:0160,51644,643,05322,391,00002,514,944
9Mar 13, 2026 15:0160,55941,582,30521,389,0001,018,0002,404,352