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 listAug 16, 2026 12:44marko1597marko1597Score: 6,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 12:482,69230,307,52421,032,0001,046,0002,117,632stderr
2Aug 16, 2026 12:482,70130,586,04121,025,0001,128,0002,117,632stderr
3Aug 16, 2026 12:486,27659,966,69750,439,0001,030,0002,117,632stderr
4Aug 16, 2026 12:486,39560,872,38351,410,0001,032,0002,117,632stderr
5Aug 16, 2026 12:486,40360,948,68551,304,0001,208,0002,117,632stderr
6Aug 16, 2026 12:486,42861,337,56151,646,0001,067,0002,117,632stderr
7Aug 16, 2026 12:486,47161,465,71651,993,0001,071,0002,117,632stderr
8Aug 16, 2026 12:486,49461,354,39452,233,0001,020,0002,117,632stderr
9Aug 16, 2026 12:486,55362,170,78352,697,0001,043,0002,117,632stderr