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 listApr 18, 2025 19:34emily graceemily graceScore: 70,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 19:3470,29749,341,16724,010,0002,000,0002,269,184
2Apr 18, 2025 19:3470,55749,850,14625,102,0001,004,0002,289,664
3Apr 18, 2025 19:3471,43056,619,92325,413,0001,016,0002,371,584