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 26, 2026 18:55Dominique GarmierDominique GarmierScore: 160,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 18:55155,4751,299,626,2001,263,892,00010,999,0002,482,176
2Mar 26, 2026 17:05156,6101,305,697,4021,273,210,00010,993,0002,412,544
3Mar 26, 2026 17:05156,9781,316,447,4661,273,229,00013,991,0002,510,848
4Mar 26, 2026 18:55160,1661,339,626,4251,300,367,00012,993,0002,289,664
5Mar 26, 2026 18:55161,1731,350,082,3921,311,618,0009,997,0002,412,544
6Mar 26, 2026 17:05162,2421,354,147,1131,315,393,00014,993,0002,375,680