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:30M-RochatM-RochatScore: 59,929Success
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:3559,63733,439,07820,986,0001,080,0002,113,536
2May 18, 2026 05:3559,66232,885,62521,001,0001,074,0002,113,536
3May 18, 2026 05:3559,67831,954,09821,022,0001,059,0002,117,632
4May 18, 2026 05:3559,84532,467,16121,077,0001,066,0002,113,536
5May 18, 2026 05:3559,92933,172,70421,021,0001,153,0002,113,536
6May 18, 2026 05:3560,00833,880,68521,047,0001,156,0002,113,536
7May 18, 2026 05:35116,49452,209,71642,018,0001,085,0002,113,536
8May 18, 2026 05:35116,51655,314,73541,955,0001,156,0002,113,536
9May 18, 2026 05:35117,06753,216,57742,137,0001,178,0002,113,536