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 listOct 9, 2023 02:53sliceteamsliceteamScore: 21,284,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2023 02:5321,277,8237,939,554,7357,872,794,37702,289,664
2Oct 9, 2023 02:5321,284,3787,939,512,3667,875,220,02202,277,376
3Oct 9, 2023 02:5321,295,3047,937,487,0077,879,262,40502,293,760