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 00:51Chandrasekaran AkashChandrasekaran AkashScore: 65,151Success
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 00:5165,08148,245,10223,077,0001,003,0002,269,184
2Apr 18, 2025 00:5165,15143,884,79323,102,0001,004,0002,527,232
3Apr 18, 2025 00:5165,56847,064,78023,250,0001,010,0002,260,992