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 1, 2026 22:01Mehdi-Dehghan-FooladiMehdi-Dehghan-FooladiScore: 22,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 22:0222,209199,660,674178,116,0004,002,0002,375,680
2May 1, 2026 22:0222,283204,292,115178,731,0003,994,0002,379,776
3May 1, 2026 22:0222,297203,112,514179,841,0002,997,0002,371,584
4May 1, 2026 22:0222,332202,040,652179,128,0004,002,0002,371,584
5May 1, 2026 22:0222,523204,547,483180,698,0003,993,0002,375,680
6May 1, 2026 22:0222,603202,129,075182,344,0003,005,0002,371,584
7May 1, 2026 22:0222,809204,844,953183,034,0004,000,0002,363,392
8May 1, 2026 22:0222,816203,538,688183,092,0004,002,0002,322,432
9May 1, 2026 22:0222,848205,101,882184,352,0003,005,0002,322,432