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 11, 2026 18:13Pavel SkripkinPavel SkripkinScore: 25,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 18:144,15441,418,68030,993,0003,072,0002,117,632
2May 11, 2026 18:144,28543,721,98130,803,0004,335,0002,117,632
3May 11, 2026 18:1425,025212,585,054202,016,0003,189,0002,117,632
4May 11, 2026 18:1425,165213,692,875203,141,0003,220,0002,117,632
5May 11, 2026 18:1425,453219,245,597204,716,0004,005,0002,117,632
6May 11, 2026 18:1425,517217,344,235206,136,0003,110,0002,117,632
7May 11, 2026 18:1425,533219,084,660205,123,0004,250,0002,117,632
8May 11, 2026 18:1425,560218,862,940206,312,0003,282,0002,117,632
9May 11, 2026 18:1425,836220,314,660208,592,0003,264,0002,117,632