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 listNov 28, 2024 17:54Joad 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
1Nov 28, 2024 17:5500000Error: expected "429496455362 ", got "365072028266 "stderr
2Nov 28, 2024 17:5459,53039,930,93421,025,0001,001,0002,531,328
3Nov 28, 2024 17:5459,67643,255,42321,077,0001,003,0002,428,928
4Nov 28, 2024 17:5459,90543,787,40420,150,0002,015,0002,510,848