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 listJul 7, 2026 13:47IlyaIlyaScore: 60,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 13:4960,06431,868,79121,112,0001,112,0002,113,536
2Jul 7, 2026 13:4960,07032,455,41221,081,0001,145,0002,113,536
3Jul 7, 2026 13:4960,17031,894,82121,149,0001,114,0002,113,536
4Jul 7, 2026 13:4960,21831,913,58621,080,0001,201,0002,113,536
5Jul 7, 2026 13:4960,23531,884,97821,154,0001,133,0002,113,536
6Jul 7, 2026 13:4960,24833,589,80821,144,0001,148,0002,113,536
7Jul 7, 2026 13:4960,30832,532,45021,076,0001,238,0002,113,536
8Jul 7, 2026 13:4960,33531,999,16521,122,0001,202,0002,113,536
9Jul 7, 2026 13:4960,52732,082,95321,277,0001,118,0002,113,536