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 27, 2026 22:27TudyMTudyMScore: 19,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:3119,205175,527,939156,479,0001,009,0002,367,488
2Apr 27, 2026 22:3119,212178,437,856156,543,0001,003,0002,371,584
3Apr 27, 2026 22:3119,221175,586,030154,621,0002,992,0002,306,048
4Apr 27, 2026 22:3119,231177,676,422155,700,0001,996,0002,371,584
5Apr 27, 2026 22:3119,274174,646,666157,051,0001,000,0002,383,872
6Apr 27, 2026 22:3119,310175,938,757157,344,0001,002,0002,355,200
7Apr 27, 2026 22:3119,352174,746,372153,698,0004,990,0002,301,952
8Apr 27, 2026 22:3119,391176,505,811157,008,0002,000,0002,379,776
9Apr 27, 2026 22:3119,416175,589,510157,210,0002,002,0002,371,584