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 listSep 19, 2026 19:55Andrew EpsteinAndrew EpsteinScore: 73,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 19:5672,661606,291,521594,805,0001,023,0002,117,632stderr
2Sep 19, 2026 19:5673,051609,573,856598,019,0001,002,0002,117,632stderr
3Sep 19, 2026 19:5673,250611,287,395599,643,0001,013,0002,117,632stderr
4Sep 19, 2026 19:5673,272611,291,798599,834,0001,001,0002,117,632stderr
5Sep 19, 2026 19:5673,334611,821,656600,340,0001,004,0002,117,632stderr
6Sep 19, 2026 19:5673,514613,203,475601,816,0001,002,0002,117,632stderr
7Sep 19, 2026 19:5673,515613,400,266601,802,0001,028,0002,117,632stderr
8Sep 19, 2026 19:5673,609614,027,605602,572,0001,022,0002,117,632stderr
9Sep 19, 2026 19:5673,805616,286,044604,203,0001,002,0002,117,632stderr