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 23, 2024 16:47E SequeiraE SequeiraScore: 21,606,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 16:4721,526,5547,995,052,2387,765,980,000198,845,0002,281,472
2Nov 23, 2024 16:4721,543,6058,001,902,6627,762,288,000208,846,0002,281,472
3Nov 23, 2024 16:4721,544,7038,003,438,7117,764,708,000206,832,0002,281,472
4Nov 23, 2024 16:4721,561,8148,013,694,3647,775,027,000202,844,0002,338,816
5Nov 23, 2024 16:4721,606,5418,022,460,4507,797,558,000196,862,0002,281,472
6Nov 23, 2024 16:4721,636,1498,043,397,4877,800,545,000204,830,0002,269,184
7Nov 23, 2024 16:4721,677,9578,056,040,9747,820,998,000199,846,0002,281,472
8Nov 23, 2024 16:4721,709,4548,064,408,1947,823,642,000208,856,0002,281,472
9Nov 23, 2024 16:4721,737,4598,082,254,2067,842,014,000200,846,0002,281,472