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:48Chandrasekaran AkashChandrasekaran AkashScore: 61,770Success
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:4760,91447,659,82521,514,0001,024,0002,445,312
2Apr 18, 2025 02:4760,95944,025,01722,555,00002,441,216
3Apr 18, 2025 02:4761,03846,194,71021,558,0001,026,0002,441,216
4Apr 18, 2025 02:4861,77038,926,09720,868,0001,987,0002,445,312
5Apr 18, 2025 02:4861,91447,206,81921,912,000996,0002,441,216
6Apr 18, 2025 02:4862,77051,738,83122,216,0001,009,0002,441,216