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 listJan 2, 2026 08:04Rajarshi BasuRajarshi BasuScore: 5,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 08:044,74164,686,78036,885,0001,993,0002,428,928
2Jan 2, 2026 08:045,18268,939,55840,471,0002,023,0002,281,472
3Jan 2, 2026 08:045,25069,586,86739,044,0004,004,0002,502,656
4Jan 2, 2026 08:045,56069,462,57441,539,0004,052,0002,461,696
5Jan 2, 2026 08:045,80077,232,22743,515,0004,047,0002,510,848
6Jan 2, 2026 08:0492,320784,059,379635,179,000121,842,0002,433,024
7Jan 2, 2026 08:0496,714821,028,120677,191,000115,861,0002,387,968
8Jan 2, 2026 08:04105,057892,558,616742,540,000118,926,0002,342,912
9Jan 2, 2026 08:04109,349922,891,260766,709,000129,950,0002,502,656