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 listMay 3, 2026 15:59TudyMTudyMScore: 11,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 16:1311,944112,753,43596,933,0001,014,0002,523,136
2May 3, 2026 16:1311,947112,417,25196,951,0001,017,0002,543,616
3May 3, 2026 16:1311,950116,532,21096,985,0001,010,0002,523,136
4May 3, 2026 16:1311,951113,104,17196,994,0001,012,0002,539,520
5May 3, 2026 16:1311,952115,041,12896,997,0001,012,0002,527,232
6May 3, 2026 16:1311,959114,411,60797,055,0001,010,0002,543,616
7May 3, 2026 16:1311,961111,652,19397,064,0001,018,0002,531,328
8May 3, 2026 16:1311,965114,057,00097,097,0001,019,0002,543,616
9May 3, 2026 16:1311,976113,111,30197,170,0001,034,0002,514,944