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 7, 2024 14:30Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2024 14:3000000Error: expected "429496548695 ", got "429496543806 "
2May 7, 2024 14:3000000Error: expected "429496514951 ", got "429496505892 "
3May 7, 2024 14:3100000Error: expected "429496480283 ", got "408021650398 "
4May 7, 2024 14:3200000Error: expected "429496520043 ", got "429496516626 "
5May 7, 2024 14:3200000Error: expected "429496518259 ", got "429496509288 "
6May 7, 2024 14:3200000Error: expected "429496496439 ", got "420906568976 "
7May 7, 2024 14:3200000Error: expected "429496547371 ", got "429496545769 "
8May 7, 2024 18:4500000Error: expected "429496490318 ", got "420906557197 "
9May 7, 2024 18:4500000Error: expected "429496542163 ", got "429496532801 "