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 listDec 24, 2024 23:30Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2024 23:2700000Error: No answer to stdout. Died or killed?stderr
2Dec 24, 2024 23:2800000Error: expected "2237540212 ", got "0"stderr
3Dec 24, 2024 23:2800000Error: No answer to stdout. Died or killed?stderr
4Dec 24, 2024 23:306,29183,593,39949,566,0002,023,0002,277,376
5Dec 24, 2024 23:306,32178,391,66549,839,0001,993,0002,420,736
6Dec 24, 2024 23:306,64780,247,72451,479,0003,028,0002,424,832