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 01:07Chandrasekaran AkashChandrasekaran AkashScore: 62,000Success
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 01:0761,91449,975,18321,912,000996,0002,531,328
2Apr 18, 2025 01:0762,00051,450,53221,943,000997,0002,445,312
3Apr 18, 2025 01:0762,32251,572,10322,057,0001,002,0002,453,504