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 listMay 10, 2026 10:12Pavel SkripkinPavel SkripkinScore: 25,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:134,49251,519,07233,469,0003,373,0002,392,064
2May 10, 2026 10:134,55953,896,64333,093,0004,291,0002,465,792
3May 10, 2026 10:1324,984219,117,755201,601,0003,273,0002,351,104
4May 10, 2026 10:1325,695224,331,956207,465,0003,238,0002,404,352
5May 10, 2026 10:1325,865224,965,657208,798,0003,295,0002,301,952
6May 10, 2026 10:1325,911225,164,668209,227,0003,250,0002,453,504
7May 10, 2026 10:1326,073228,583,722210,653,0003,147,0002,355,200
8May 10, 2026 10:1326,210229,204,255210,894,0004,030,0002,551,808
9May 10, 2026 10:1326,593235,083,632214,043,0004,026,0002,379,776