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 1, 2026 10:38Victor MerckléVictor MerckléScore: 2,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 10:392,72430,480,80221,195,0001,149,0002,117,632stderr
2Sep 1, 2026 10:392,72631,357,38621,294,0001,064,0002,117,632stderr
3Sep 1, 2026 10:392,72930,710,02021,355,0001,026,0002,117,632stderr
4Sep 1, 2026 10:392,73030,850,62021,285,0001,102,0002,117,632stderr
5Sep 1, 2026 10:392,73630,658,45821,359,0001,078,0002,117,632stderr
6Sep 1, 2026 10:392,74032,279,89921,392,0001,078,0002,117,632stderr
7Sep 1, 2026 10:392,74230,847,62721,425,0001,066,0002,117,632stderr
8Sep 1, 2026 10:392,82031,577,26521,977,0001,149,0002,117,632stderr
9Sep 1, 2026 10:395,40752,724,03443,331,0001,013,0002,117,632stderr