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 listJul 24, 2024 17:42AnSaAnSaScore: 88,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 17:4287,91656,363,30931,513,0001,016,0002,277,376
2Jul 24, 2024 17:4288,32760,523,63931,660,0001,021,0002,277,376
3Jul 24, 2024 17:4288,40060,717,60531,686,0001,022,0002,277,376
4Jul 24, 2024 17:4288,53261,312,46531,734,0001,023,0002,269,184
5Jul 24, 2024 17:4288,66558,961,83529,824,0002,982,0002,273,280
6Jul 24, 2024 17:4288,68163,536,32530,824,0001,988,0002,273,280
7Jul 24, 2024 17:4288,86562,617,24930,825,0002,055,0002,281,472
8Jul 24, 2024 17:4289,41459,665,61231,078,0002,005,0002,277,376
9Jul 24, 2024 17:4289,44961,473,95531,091,0002,005,0002,277,376
10Jul 24, 2024 17:4293,734111,747,24734,681,61102,269,184
11Jul 24, 2024 17:4293,810107,719,58134,709,71002,265,088
12Jul 24, 2024 17:4294,42396,638,95534,936,53102,269,184