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 listSep 2, 2026 07:35C#_userC#_userScore: 153,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 07:39125,4791,038,777,549891,102,000137,826,0002,150,400
2Sep 2, 2026 07:39140,8601,165,193,4501,015,879,000139,173,0002,150,400
3Sep 2, 2026 07:39143,2361,184,663,2101,035,059,000139,484,0002,150,400
4Sep 2, 2026 07:39143,9951,190,598,8421,042,203,000138,562,0002,150,400
5Sep 2, 2026 07:39153,6031,269,645,2111,117,321,000142,228,0002,121,728
6Sep 2, 2026 07:39155,3071,283,746,6411,134,356,000139,167,0002,150,400
7Sep 2, 2026 07:39157,3651,300,212,0191,149,379,000141,017,0002,154,496
8Sep 2, 2026 07:39161,1371,331,237,1801,181,725,000139,606,0002,150,400
9Sep 2, 2026 07:39193,4211,596,244,5111,444,747,000141,306,0002,150,400