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 listDec 29, 2025 15:50Josu San MartinJosu San MartinScore: 634,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 15:50625,043255,120,26852,060,000179,206,0002,318,336
2Dec 29, 2025 15:50631,757260,480,40150,945,000182,805,0002,445,312
3Dec 29, 2025 15:50632,065258,509,16649,971,000183,893,0002,396,160
4Dec 29, 2025 15:50633,535273,594,07250,087,000184,321,0002,400,256
5Dec 29, 2025 15:50634,786263,590,66949,972,000184,899,0002,387,968
6Dec 29, 2025 15:50638,554260,594,94851,057,000185,208,0002,392,064
7Dec 29, 2025 15:50640,716257,660,19252,014,000185,051,0002,383,872
8Dec 29, 2025 15:50655,173270,480,44550,877,000191,537,0002,281,472
9Dec 29, 2025 15:50655,778272,583,05552,921,000189,717,0002,297,856