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 30, 2026 11:28Dominique GarmierDominique GarmierScore: 12,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 09:0712,447127,843,215101,064,0001,000,0002,383,872
2Mar 30, 2026 09:0712,448130,441,595100,072,0002,001,0002,408,448
3Mar 30, 2026 11:2812,450124,751,143101,086,0001,000,0002,437,120
4Mar 30, 2026 09:0712,473124,274,091100,272,0002,005,0002,404,352
5Mar 30, 2026 11:2812,490125,615,755101,412,0001,004,0002,416,640
6Mar 30, 2026 11:2812,536127,666,307101,795,000997,0002,338,816