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 listApr 22, 2026 16:19olliecrowolliecrowScore: 23,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 16:203,35944,453,94526,524,0001,020,0002,416,640
2Apr 22, 2026 16:2023,764211,481,816192,873,0001,998,0002,306,048
3Apr 22, 2026 16:2023,776214,221,189191,969,0002,999,0002,502,656
4Apr 22, 2026 16:2023,781219,286,455192,009,0003,000,0002,531,328
5Apr 22, 2026 16:2023,807213,137,926191,215,0004,004,0002,506,752
6Apr 22, 2026 16:2023,815212,879,408192,279,0003,004,0002,457,600
7Apr 22, 2026 16:2023,820214,949,853193,329,0002,003,0002,424,832
8Apr 22, 2026 16:2023,893215,775,050192,932,0002,998,0002,412,544
9Apr 22, 2026 16:2023,895210,915,471191,942,0003,998,0002,469,888