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 16:15TudyMTudyMScore: 12,030Success
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:2411,990113,968,37897,306,0001,020,0002,482,176
2May 3, 2026 16:2412,012113,421,63397,467,0001,036,0002,482,176
3May 3, 2026 16:2412,019114,954,67697,520,0001,039,0002,461,696
4May 3, 2026 16:2412,026114,277,14097,592,0001,023,0002,473,984
5May 3, 2026 16:2412,030117,365,32897,600,0001,048,0002,469,888
6May 3, 2026 16:2412,033112,326,00097,655,0001,018,0002,482,176
7May 3, 2026 16:2412,037113,625,99197,675,0001,030,0002,469,888
8May 3, 2026 16:2412,044112,084,06997,724,0001,042,0002,437,120
9May 3, 2026 16:2412,050115,936,98997,756,0001,058,0002,461,696