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 listApr 21, 2026 09:43Dominique GarmierDominique GarmierScore: 71,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 09:4471,22947,563,57825,342,0001,013,0002,494,464
2Apr 21, 2026 09:4471,34849,582,63125,384,0001,015,0002,502,656
3Apr 21, 2026 09:4471,41649,565,56025,408,0001,016,0002,494,464
4Apr 21, 2026 09:4471,42455,651,53525,411,0001,016,0002,273,280
5Apr 21, 2026 09:4471,55446,643,87226,475,00002,502,656
6Apr 21, 2026 09:4471,73551,218,99625,522,0001,020,0002,494,464
7Apr 21, 2026 09:4471,95955,646,17225,601,0001,024,0002,506,752
8Apr 21, 2026 09:4472,04051,499,04225,630,0001,025,0002,494,464
9Apr 21, 2026 09:4474,41658,632,60626,515,0001,019,0002,256,896