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 listApr 29, 2026 21:58Charles CabergsCharles CabergsScore: 71,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 21:5970,77041,672,38524,171,0002,014,0002,371,584
2Apr 29, 2026 21:5970,89143,527,44724,213,0002,017,0002,359,296
3Apr 29, 2026 21:5970,91645,844,50824,221,0002,018,0002,363,392
4Apr 29, 2026 21:5970,97544,871,30424,241,0002,020,0002,359,296
5Apr 29, 2026 21:5971,03545,799,56624,262,0002,021,0002,363,392
6Apr 29, 2026 21:5971,05144,176,18625,278,0001,011,0002,306,048
7Apr 29, 2026 21:5971,07243,174,41624,275,0002,022,0002,351,104
8Apr 29, 2026 21:5971,16441,189,11925,319,0001,012,0002,437,120
9Apr 29, 2026 21:5971,17538,840,28124,310,0002,025,0002,424,832