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 26, 2025 21:39Aniruddha DebAniruddha DebScore: 69,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2025 21:3969,43852,825,23125,692,00002,523,136
2Mar 26, 2025 21:3969,89561,575,39324,867,000994,0002,404,352
3Mar 26, 2025 21:3969,89750,652,86824,868,000994,0002,400,256