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:27Chandrasekaran AkashChandrasekaran AkashScore: 60,657Success
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:2760,64348,189,82622,438,00002,531,328
2Apr 18, 2025 02:2760,65744,682,07121,423,0001,020,0002,531,328
3Apr 18, 2025 02:2760,85748,285,09722,517,00002,531,328