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 listJun 29, 2026 21:15IlyaIlyaScore: 60,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 21:1760,11831,750,94621,147,0001,097,0002,113,536
2Jun 29, 2026 21:1760,12731,673,29521,140,0001,107,0002,113,536
3Jun 29, 2026 21:1760,23731,776,75721,187,0001,101,0002,113,536
4Jun 29, 2026 21:1760,34331,791,29721,209,0001,118,0002,113,536
5Jun 29, 2026 21:1760,37031,756,59221,237,0001,100,0002,113,536
6Jun 29, 2026 21:1760,41333,070,06321,242,0001,111,0002,113,536
7Jun 29, 2026 21:1760,51032,021,31021,268,0001,121,0002,113,536
8Jun 29, 2026 21:1760,77232,438,95321,262,0001,224,0002,113,536
9Jun 29, 2026 21:1762,16443,206,64121,782,0001,219,0002,113,536