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 02:12M-RochatM-RochatScore: 63,018Success
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 02:1462,82434,028,09422,031,0001,214,0002,113,536
2May 18, 2026 02:1462,91833,906,58122,018,0001,262,0002,113,536
3May 18, 2026 02:1462,94534,197,50922,017,0001,273,0002,113,536
4May 18, 2026 02:1462,95434,452,76522,020,0001,273,0002,113,536
5May 18, 2026 02:1463,01834,434,72822,050,0001,267,0002,113,536
6May 18, 2026 02:1463,05934,697,64822,036,0001,296,0002,113,536
7May 18, 2026 02:1463,11033,240,98522,073,0001,278,0002,113,536
8May 18, 2026 02:1463,11335,297,86322,058,0001,294,0002,113,536
9May 18, 2026 02:1463,21033,923,95622,147,0001,241,0002,113,536