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 listJul 27, 2024 16:05Joad 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
1Jul 27, 2024 16:0500000Error: expected "429496442537 ", got "416611555640 "stderr
2Jul 27, 2024 16:0600000Error: expected "429496450582 ", got "382251868510 "stderr
3Jul 27, 2024 16:0700000Error: expected "429496488791 ", got "429496485604 "stderr