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 11, 2025 15:00Chandrasekaran AkashChandrasekaran AkashScore: 7,363,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 15:007,192,3192,686,249,9722,660,159,000999,0002,269,184
2Apr 11, 2025 15:007,363,3682,751,670,4192,724,446,00002,269,184
3Apr 11, 2025 15:007,398,9842,763,587,6462,735,626,0001,998,0002,269,184