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 6, 2024 23:19Joad NacerJoad NacerScore: 417,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2024 23:19414,220212,199,586153,261,34702,289,664
2May 6, 2024 23:19417,208229,447,498154,367,03102,297,856
3May 6, 2024 23:19417,965225,984,195154,646,92502,281,472