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 26, 2026 10:46Dominique GarmierDominique GarmierScore: 72,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 10:4671,21450,672,26625,336,0001,013,0002,277,376
2Mar 26, 2026 10:4672,89549,362,99924,974,0001,997,0002,478,080
3Mar 26, 2026 10:4674,87051,824,42026,676,0001,026,0002,494,464