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 30, 2026 07:39IlyaIlyaScore: 64,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 07:4063,94033,118,56322,558,0001,100,0002,113,536
2Jun 30, 2026 07:4064,06233,197,58622,520,0001,183,0002,113,536
3Jun 30, 2026 07:4064,14533,172,34522,641,0001,093,0002,113,536
4Jun 30, 2026 07:4064,32433,705,34822,600,0001,200,0002,113,536
5Jun 30, 2026 07:4064,49733,800,30722,824,0001,040,0002,113,536
6Jun 30, 2026 07:4065,99433,977,56623,217,0001,201,0002,113,536
7Jun 30, 2026 07:4066,07833,974,88223,262,0001,187,0002,113,536
8Jun 30, 2026 07:4066,27834,047,14423,331,0001,192,0002,113,536
9Jun 30, 2026 07:4068,71046,040,32324,173,0001,250,0002,113,536