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 listJan 18, 2026 04:18Josu San MartinJosu San MartinScore: 9,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 04:189,687103,024,44677,421,0002,010,0002,469,888
2Jan 18, 2026 04:189,695104,547,86178,491,0001,006,0002,420,736
3Jan 18, 2026 04:189,708110,242,06478,595,0001,007,0002,465,792
4Jan 18, 2026 04:189,719110,999,67378,698,000996,0002,465,792
5Jan 18, 2026 04:189,720108,467,38577,709,0001,992,0002,453,504
6Jan 18, 2026 04:189,720106,651,95777,712,0001,992,0002,519,040
7Jan 18, 2026 04:189,721111,158,55378,714,000996,0002,408,448
8Jan 18, 2026 04:189,725109,038,40477,751,0001,993,0002,416,640
9Jan 18, 2026 04:189,726111,319,40977,758,0001,993,0002,465,792