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 02:49Chandrasekaran AkashChandrasekaran AkashScore: 61,249Success
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 02:4960,99751,704,90821,544,0001,025,0002,269,184
2Apr 18, 2025 02:4961,24946,906,05722,662,00002,441,216
3Apr 18, 2025 02:4961,77651,615,46820,870,0001,987,0002,445,312