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 30, 2026 13:33Dominique GarmierDominique GarmierScore: 70,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 13:3270,48954,488,20124,075,0002,006,0002,371,584
2Mar 30, 2026 13:3370,58454,336,57125,112,0001,004,0002,355,200
3Mar 30, 2026 13:3270,65751,793,24825,138,0001,005,0002,363,392
4Mar 30, 2026 13:3370,67053,040,49125,143,0001,005,0002,375,680
5Mar 30, 2026 13:3370,87654,768,16424,207,0002,017,0002,289,664
6Mar 30, 2026 13:3270,89550,266,90925,223,0001,008,0002,367,488