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 09:13Zhou180Zhou180Score: 22,071Success
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 09:133,44837,484,17727,249,0001,030,0002,117,632
2Jun 26, 2026 09:133,47037,622,47327,421,0001,036,0002,117,632
3Jun 26, 2026 09:1321,635186,627,845175,398,0002,010,0002,117,632
4Jun 26, 2026 09:1321,994189,484,828178,341,0002,011,0002,117,632
5Jun 26, 2026 09:1322,071190,602,223177,968,0003,016,0002,117,632
6Jun 26, 2026 09:1322,164190,971,979178,705,0003,045,0002,117,632
7Jun 26, 2026 09:1322,184191,026,805178,897,0003,019,0002,117,632
8Jun 26, 2026 09:1322,363192,603,274181,373,0002,010,0002,117,632
9Jun 26, 2026 09:1322,625194,619,975182,497,0003,032,0002,117,632