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 12, 2026 08:01Haha ExpertHaha ExpertScore: 32,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 08:0231,702269,413,955124,410,000135,554,0002,117,632
2Sep 12, 2026 08:0231,837270,424,685124,453,000136,612,0002,117,632
3Sep 12, 2026 08:0231,964271,536,198125,519,000136,592,0002,117,632
4Sep 12, 2026 08:0232,010271,936,084125,893,000136,594,0002,117,632
5Sep 12, 2026 08:0232,051272,232,887125,712,000137,111,0002,117,632
6Sep 12, 2026 08:0232,059272,346,300125,286,000137,601,0002,117,632
7Sep 12, 2026 08:0232,102271,892,841125,415,000137,826,0002,117,632
8Sep 12, 2026 08:0232,362274,847,458127,305,000138,066,0002,117,632
9Sep 12, 2026 08:0232,568275,871,324129,807,000137,258,0002,117,632