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 listNov 1, 2025 09:06AntonAntonScore: 76,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2025 09:0670,714602,782,415405,900,000173,957,0002,314,240
2Nov 1, 2025 09:0671,108607,466,813409,061,000174,026,0002,277,376
3Nov 1, 2025 09:0671,596616,970,285411,360,000175,726,0002,363,392
4Nov 1, 2025 09:0673,999629,098,059428,852,000177,938,0002,314,240
5Nov 1, 2025 09:0676,010647,147,872447,486,000175,798,0002,322,432
6Nov 1, 2025 09:0676,072647,136,232451,846,000171,941,0002,322,432
7Nov 1, 2025 09:0677,485664,375,152458,549,000176,826,0002,314,240
8Nov 1, 2025 09:0683,723713,340,714509,653,000176,879,0002,428,928
9Nov 1, 2025 09:0686,220735,577,128530,254,000176,751,0002,326,528