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 listFeb 10, 2026 10:50MMisMMisScore: 1,654,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 10:501,238,332484,484,940275,509,000182,674,0002,281,472
2Feb 10, 2026 10:501,305,832511,025,928301,475,000181,683,0002,281,472
3Feb 10, 2026 10:501,490,754574,531,409370,717,000180,862,0002,269,184
4Feb 10, 2026 10:501,599,376618,048,774407,841,000183,928,0002,301,952
5Feb 10, 2026 10:501,654,176643,974,977433,324,000178,721,0002,269,184
6Feb 10, 2026 10:501,668,246643,273,408431,477,000185,774,0002,281,472
7Feb 10, 2026 10:501,792,432689,651,687480,421,000182,779,0002,301,952
8Feb 10, 2026 10:501,988,100760,461,398546,701,000188,896,0002,453,504
9Feb 10, 2026 10:502,118,532820,442,891599,127,000184,730,0002,273,280