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 21, 2026 19:09M-RochatM-RochatScore: 58,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 19:1058,80232,107,71120,756,0001,001,0002,113,536
2May 21, 2026 19:1058,82930,195,29020,759,0001,008,0002,113,536
3May 21, 2026 19:1058,86430,140,60320,753,0001,027,0002,113,536
4May 21, 2026 19:1058,87532,688,04320,781,0001,003,0002,113,536
5May 21, 2026 19:1058,90530,729,65920,765,0001,030,0002,113,536
6May 21, 2026 19:1058,94531,210,16321,810,00002,113,536
7May 21, 2026 19:1059,05431,927,54120,816,0001,034,0002,113,536
8May 21, 2026 19:1059,22730,763,65520,894,0001,020,0002,113,536
9May 21, 2026 19:1059,70530,880,60821,045,0001,046,0002,113,536