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 13:17AnSaAnSaScore: 107,957Success
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 13:17107,07368,753,54736,570,0003,047,0002,265,088
2Jan 29, 2024 13:17107,07871,033,65538,604,0001,015,0002,265,088
3Jan 29, 2024 13:17107,62262,796,85137,829,0001,991,0002,277,376
4Jan 29, 2024 13:17107,64665,237,69238,834,000995,0002,277,376
5Jan 29, 2024 13:17107,70367,937,63937,858,0001,992,0002,273,280
6Jan 29, 2024 13:17107,72467,735,62937,866,0001,992,0002,265,088
7Jan 29, 2024 13:17107,95761,334,96737,947,0001,997,0002,392,064
8Jan 29, 2024 13:17108,46559,345,78038,126,0002,006,0002,277,376
9Jan 29, 2024 13:17108,61662,941,30338,179,0002,009,0002,277,376
10Jan 29, 2024 13:17110,333106,019,83640,823,14002,265,088
11Jan 29, 2024 13:17110,53998,535,16840,899,58902,203,648
12Jan 29, 2024 13:17111,013112,394,82241,074,82502,260,992