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 listApr 19, 2025 00:00emily graceemily graceScore: 71,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2025 00:0071,14947,875,28024,300,0002,025,0002,289,664
2Apr 19, 2025 00:0071,43253,070,55925,414,0001,016,0002,289,664
3Apr 19, 2025 00:0071,53047,214,49525,449,0001,017,0002,269,184
4Apr 19, 2025 00:0071,55453,642,15325,457,0001,018,0002,269,184
5Apr 19, 2025 00:0071,98151,956,78025,609,0001,024,0002,269,184
6Apr 19, 2025 00:0084,48658,931,83629,244,0002,016,0002,269,184