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 17:57Chandrasekaran AkashChandrasekaran AkashScore: 70,681Success
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 17:5770,29744,949,78724,010,0002,000,0002,453,504
2Apr 11, 2025 17:5770,68152,035,85024,141,0002,011,0002,269,184
3Apr 11, 2025 17:5770,74950,598,88825,171,0001,006,0002,445,312