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 listMar 20, 2026 21:19Josu San MartinJosu San MartinScore: 68,576Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 21:1965,27647,935,07623,146,0001,006,0002,269,184
2Mar 20, 2026 21:1968,57652,416,90524,359,0001,014,0002,387,968
3Mar 20, 2026 21:1969,79557,952,70123,838,0001,986,0002,531,328