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 listMar 10, 2026 20:58olliecrowolliecrowScore: 10,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 20:5810,034106,486,67079,272,0003,010,0002,478,080
2Mar 10, 2026 20:5810,152112,067,99279,233,0004,011,0002,367,488
3Mar 10, 2026 20:5810,269107,477,43481,195,0003,007,0002,400,256
4Mar 10, 2026 20:5810,277115,365,46282,269,0002,006,0002,416,640
5Mar 10, 2026 20:5810,283107,825,20981,308,0003,011,0002,355,200
6Mar 10, 2026 20:5810,372116,466,06284,053,0001,000,0002,408,448
7Mar 10, 2026 20:5810,429111,655,79282,499,0003,018,0002,269,184
8Mar 10, 2026 20:5815,161155,870,002122,315,0002,005,0002,420,736
9Mar 10, 2026 20:5815,694156,333,212125,695,0002,992,0002,289,664