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 09:06Chandrasekaran AkashChandrasekaran AkashScore: 62,614Success
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 09:0662,33845,870,74822,063,0001,002,0002,445,312
2Apr 14, 2025 09:0662,61447,959,61721,153,0002,014,0002,269,184
3Apr 14, 2025 09:0662,64946,814,82922,173,0001,007,0002,531,328