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 listAug 29, 2026 12:48Victor MerckléVictor MerckléScore: 2,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 12:492,72030,665,88321,213,0001,091,0002,117,632stderr
2Aug 29, 2026 12:492,74130,609,35821,463,0001,020,0002,117,632stderr
3Aug 29, 2026 12:492,74232,145,13921,463,0001,023,0002,117,632stderr
4Aug 29, 2026 12:492,74330,870,42921,475,0001,018,0002,117,632stderr
5Aug 29, 2026 12:492,75230,898,71921,538,0001,033,0002,117,632stderr
6Aug 29, 2026 12:495,37752,437,61743,062,0001,035,0002,117,632stderr
7Aug 29, 2026 12:495,39352,355,39043,193,0001,035,0002,117,632stderr
8Aug 29, 2026 12:495,41352,548,24243,240,0001,150,0002,117,632stderr
9Aug 29, 2026 12:495,43552,939,08743,312,0001,262,0002,117,632stderr