Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listApr 21, 2026 03:02Adewuyi IsraelAdewuyi IsraelScore: 392,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 03:02392,5703,283,670,9913,193,368,00064,966,0002,265,088
2Apr 21, 2026 03:02392,6713,283,657,9243,195,206,00063,964,0002,265,088
3Apr 21, 2026 03:02392,7153,287,544,7333,211,558,00047,978,0002,490,368
4Apr 21, 2026 03:02392,7743,288,775,6363,179,079,00080,951,0002,482,176
5Apr 21, 2026 03:02392,8933,289,579,9083,189,060,00071,956,0002,265,088
6Apr 21, 2026 03:02393,3803,288,633,6463,192,100,00072,956,0002,478,080
7Apr 21, 2026 03:02393,7523,295,536,2663,198,189,00069,960,0002,265,088
8Apr 21, 2026 03:02397,0613,322,336,2213,220,643,00074,968,0002,265,088
9Apr 21, 2026 03:02400,9803,352,637,7163,268,170,00059,966,0002,285,568