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 02:02zielajzielajScore: 31,170Success
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 02:0231,103277,974,999107,020,000148,028,0002,306,048
2Oct 13, 2024 02:0231,170282,678,669107,829,000147,766,0002,301,952
3Oct 13, 2024 02:0231,422280,259,453107,859,000149,804,0002,301,952