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 listOct 29, 2025 11:17eandr-67eandr-67Score: 273,348Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2025 11:17273,3002,296,519,6902,168,415,00099,973,0002,326,528
2Oct 29, 2025 11:17273,3072,299,610,3222,178,469,00089,978,0002,326,528
3Oct 29, 2025 11:17273,3272,291,197,8262,165,676,000102,937,0002,424,832
4Oct 29, 2025 11:17273,3372,294,726,4192,165,757,000102,940,0002,424,832
5Oct 29, 2025 11:17273,3482,296,590,5902,159,846,000108,941,0002,424,832
6Oct 29, 2025 11:17273,3662,292,928,3832,168,988,00099,953,0002,428,928
7Oct 29, 2025 11:17273,5172,296,048,7312,178,228,00091,967,0002,326,528
8Oct 29, 2025 11:17273,5182,301,568,5102,157,286,000112,910,0002,326,528
9Oct 29, 2025 11:17273,6002,296,488,4622,173,927,00096,952,0002,326,528