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 11, 2024 03:13Matt StuchlikMatt StuchlikError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 03:1300000Error: No answer to stdout. Died or killed?
2Nov 11, 2024 03:1425,733242,566,739201,011,00010,000,0002,469,888
3Nov 11, 2024 03:1326,252240,973,376203,252,00012,014,0002,445,312
4Nov 11, 2024 03:1427,890255,035,854220,706,0007,989,0002,486,272
5Nov 11, 2024 03:1428,894262,214,928221,936,00014,995,0002,306,048
6Nov 11, 2024 03:1329,205266,922,654221,449,00018,036,0002,445,312
7Nov 11, 2024 03:1329,485268,647,144225,792,00015,985,0002,424,832