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 04:32Chandrasekaran AkashChandrasekaran AkashScore: 7,220,373Success
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 04:327,166,8702,683,515,0962,649,744,0001,998,0002,531,328
2Apr 11, 2025 04:327,220,3732,697,014,8562,670,539,000999,0002,269,184
3Apr 11, 2025 04:327,681,6652,871,533,6362,842,216,00002,531,328