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 24, 2026 12:37Dominique GarmierDominique GarmierScore: 1,103,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 12:381,086,789430,607,449227,498,000174,614,0002,314,240
2Mar 24, 2026 12:381,099,841428,289,495228,967,000177,974,0002,334,720
3Mar 24, 2026 12:371,100,657434,938,783228,575,000178,668,0002,400,256
4Mar 24, 2026 12:371,103,486436,382,529229,601,000178,689,0002,502,656
5Mar 24, 2026 12:371,115,759434,961,138231,905,000180,926,0002,293,760
6Mar 24, 2026 12:381,164,430451,788,210237,911,000192,928,0002,297,856