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 17, 2026 02:13izotoffizotoffScore: 124,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 02:13122,49272,891,86944,315,0001,007,0002,314,240
2Mar 17, 2026 02:13124,18976,843,09743,953,0001,997,0002,396,160
3Mar 17, 2026 02:13124,24974,921,36443,974,0001,998,0002,318,336