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 16, 2025 00:56emily graceemily graceScore: 111,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2025 00:57110,39565,127,78240,846,00002,289,664
2Apr 16, 2025 00:57110,90070,242,73839,032,0002,001,0002,289,664
3Apr 16, 2025 00:56111,05767,995,90539,087,0002,004,0002,273,280
4Apr 16, 2025 00:57111,61667,927,18639,284,0002,014,0002,289,664
5Apr 16, 2025 00:56111,72765,243,14340,331,0001,008,0002,289,664
6Apr 16, 2025 00:56112,53273,973,03641,637,00002,269,184