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 10, 2026 13:38Pavel SkripkinPavel SkripkinScore: 24,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:404,15941,262,16830,864,0003,247,0002,117,632
2May 10, 2026 13:404,26144,611,01630,899,0004,048,0002,117,632
3May 10, 2026 13:4024,473207,921,970197,671,0003,013,0002,117,632
4May 10, 2026 13:4024,860211,073,468200,609,0003,245,0002,117,632
5May 10, 2026 13:4024,886213,644,189199,409,0004,663,0002,117,632
6May 10, 2026 13:4024,909213,488,862201,074,0003,186,0002,117,632
7May 10, 2026 13:4025,210216,878,032203,563,0003,162,0002,117,632
8May 10, 2026 13:4025,429215,843,094205,315,0003,205,0002,117,632
9May 10, 2026 13:4025,957223,281,540209,770,0003,084,0002,117,632