Median Sergey Svistunov

Find the median of 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 median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listOct 13, 2024 15:47zielajzielajScore: 14,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 15:4714,370144,673,390101,855,00015,977,0002,445,312
2Oct 13, 2024 15:4714,392145,729,982105,015,00013,001,0002,363,392
3Oct 13, 2024 15:4715,021154,979,320103,144,00020,028,0002,297,856