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 listJun 26, 2026 08:08Zhou180Zhou180Score: 21,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 08:093,52038,007,53727,827,0001,037,0002,117,632
2Jun 26, 2026 08:093,52938,087,90227,893,0001,047,0002,117,632
3Jun 26, 2026 08:093,55738,314,17428,100,0001,068,0002,117,632
4Jun 26, 2026 08:0921,439184,936,953173,794,0002,012,0002,117,632
5Jun 26, 2026 08:0921,830189,357,109176,997,0002,014,0002,117,632
6Jun 26, 2026 08:0922,061190,101,133177,869,0003,032,0002,117,632
7Jun 26, 2026 08:0922,096190,382,305179,179,0002,011,0002,117,632
8Jun 26, 2026 08:0922,167190,953,895178,752,0003,021,0002,117,632
9Jun 26, 2026 08:0922,508193,797,979181,549,0003,017,0002,117,632