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 14, 2025 07:36Chandrasekaran AkashChandrasekaran AkashScore: 7,525,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2025 07:367,471,2082,797,717,6622,763,348,000999,0002,531,328
2Apr 14, 2025 07:367,525,9142,811,458,7432,782,590,0001,998,0002,531,328
3Apr 14, 2025 07:367,540,8382,821,626,1852,790,110,00002,457,600