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 18, 2026 05:13M-RochatM-RochatScore: 59,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 05:1459,75633,022,39920,956,0001,154,0002,113,536
2May 18, 2026 05:1459,79733,052,06920,969,0001,156,0002,113,536
3May 18, 2026 05:1459,80032,508,58721,051,0001,075,0002,113,536
4May 18, 2026 05:1459,84331,626,57520,980,0001,162,0002,113,536
5May 18, 2026 05:1459,90233,461,98321,015,0001,149,0002,113,536
6May 18, 2026 05:1459,93232,891,92421,036,0001,139,0002,113,536
7May 18, 2026 05:1459,93731,358,42021,018,0001,159,0002,113,536
8May 18, 2026 05:1460,02933,029,15021,057,0001,154,0002,113,536
9May 18, 2026 05:1460,04832,687,37621,066,0001,152,0002,113,536