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 listMay 17, 2026 11:38M-RochatM-RochatScore: 65,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 11:3965,65433,224,43223,279,0001,013,0002,113,536
2May 17, 2026 11:3965,66438,842,77623,259,0001,037,0002,113,536
3May 17, 2026 11:3965,71033,733,37023,289,0001,024,0002,113,536
4May 17, 2026 11:3965,71037,082,30123,269,0001,044,0002,113,536
5May 17, 2026 11:3965,77833,132,41423,331,0001,007,0002,113,536
6May 17, 2026 11:3965,93736,065,31423,364,0001,033,0002,113,536
7May 17, 2026 11:3965,96435,400,71223,399,0001,008,0002,113,536
8May 17, 2026 11:3966,14333,864,29523,458,0001,015,0002,113,536
9May 17, 2026 11:3966,25435,074,62123,493,0001,021,0002,113,536