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 21, 2026 19:07izotoffizotoffScore: 81,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 19:0781,09757,144,72127,006,0003,000,0002,289,664
2Mar 21, 2026 19:0781,20856,944,89124,038,0006,009,0002,301,952
3Mar 21, 2026 19:0781,37661,452,11528,102,0002,007,0002,342,912
4Mar 21, 2026 19:0781,42258,511,91129,122,0001,004,0002,334,720
5Mar 21, 2026 19:0781,47656,106,69328,137,0002,009,0002,334,720
6Mar 21, 2026 19:0781,49758,770,30129,149,0001,005,0002,301,952
7Mar 21, 2026 19:0781,73853,129,23329,235,0001,008,0002,351,104
8Mar 21, 2026 19:0781,77355,430,50827,231,0003,025,0002,334,720
9Mar 21, 2026 19:0781,77855,003,90829,250,0001,008,0002,306,048