TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listNov 29, 2024 19:01E SequeiraE SequeiraScore: 120,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 19:01120,24368,221,65642,468,0002,022,0002,326,528
2Nov 29, 2024 19:01120,34170,431,83644,526,00002,326,528
3Nov 29, 2024 19:01120,35764,231,09243,520,0001,012,0002,355,200
4Nov 29, 2024 19:01120,43876,080,44442,537,0002,025,0002,314,240
5Nov 29, 2024 19:01120,61974,452,75344,629,00002,494,464
6Nov 29, 2024 19:01120,70372,155,15044,660,00002,326,528
7Nov 29, 2024 19:01121,34375,455,71642,902,0001,995,0002,326,528
8Nov 29, 2024 19:01121,75472,343,14643,047,0002,002,0002,494,464
9Nov 29, 2024 19:01123,85971,554,52744,832,000996,0002,326,528