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 listMay 23, 2024 18:43CemaCemaScore: 108,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2024 18:43107,03567,632,34438,588,0001,015,0002,281,472
2May 23, 2024 18:43107,13267,579,04338,623,0001,016,0002,326,528
3May 23, 2024 18:43107,70370,458,53537,858,0001,992,0002,519,040
4May 23, 2024 18:43107,72270,918,95334,875,0004,982,0002,281,472
5May 23, 2024 18:43107,74965,955,96737,874,0001,993,0002,510,848
6May 23, 2024 18:43107,79767,621,95837,891,0001,994,0002,502,656
7May 23, 2024 18:43108,27362,122,11138,058,0002,003,0002,281,472
8May 23, 2024 18:43108,31672,053,64038,074,0002,003,0002,281,472
9May 23, 2024 18:43110,538102,113,95640,899,22102,232,320
10May 23, 2024 18:43111,327104,304,24941,190,90302,244,608
11May 23, 2024 18:43112,240104,662,97741,528,91102,244,608
12May 23, 2024 18:43124,38667,093,21143,022,0003,001,0002,510,848