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 listJan 29, 2024 15:00AnSaAnSaScore: 104,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2024 15:00102,93060,495,01436,080,0002,004,0002,510,848
2Jan 29, 2024 15:00102,94161,530,03337,086,0001,002,0002,523,136
3Jan 29, 2024 15:00103,06560,870,33336,127,0002,007,0002,523,136
4Jan 29, 2024 15:00103,29265,662,95036,207,0002,011,0002,273,280
5Jan 29, 2024 15:00103,34963,798,38136,227,0002,012,0002,277,376
6Jan 29, 2024 15:00103,45463,101,62435,256,0003,022,0002,277,376
7Jan 29, 2024 15:00104,28461,719,62837,570,0001,015,0002,510,848
8Jan 29, 2024 15:00104,35467,602,52036,579,0002,032,0002,519,040
9Jan 29, 2024 15:00104,53267,559,69137,660,0001,017,0002,277,376
10Jan 29, 2024 15:00105,686106,944,97539,103,98802,256,896
11Jan 29, 2024 15:00105,899105,562,23939,182,56602,273,280
12Jan 29, 2024 15:00106,601112,659,29239,442,24402,265,088