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 29, 2024 21:08E SequeiraE SequeiraScore: 127,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 21:08126,71671,734,55045,888,000997,0002,379,776
2Nov 29, 2024 21:08127,16875,546,91345,050,0002,002,0002,285,568
3Nov 29, 2024 21:08128,66874,497,53146,595,0001,012,0002,285,568