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 23:51M-RochatM-RochatScore: 62,562Success
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 23:5262,29733,770,68121,895,0001,155,0002,113,536
2May 17, 2026 23:5262,40234,296,06421,950,0001,139,0002,113,536
3May 17, 2026 23:5262,41632,278,85421,941,0001,153,0002,113,536
4May 17, 2026 23:5262,53234,041,94121,980,0001,157,0002,113,536
5May 17, 2026 23:5262,56232,925,48521,989,0001,159,0002,113,536
6May 17, 2026 23:5262,58332,538,67021,975,0001,181,0002,113,536
7May 17, 2026 23:5262,70535,297,17322,008,0001,193,0002,113,536
8May 17, 2026 23:5262,75432,489,89122,077,0001,142,0002,113,536
9May 17, 2026 23:5262,76734,102,86522,058,0001,166,0002,113,536