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 18:37SavemakerSavemakerScore: 273,474Success
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 18:37273,1692,294,298,8492,171,375,00095,928,0002,326,528
2Oct 29, 2025 18:37273,1782,293,566,7672,169,406,00097,973,0002,527,232
3Oct 29, 2025 18:37273,2322,293,784,5672,148,891,000118,938,0002,326,528
4Oct 29, 2025 18:37273,3912,301,115,4262,168,225,000100,917,0002,428,928
5Oct 29, 2025 18:37273,4742,296,180,4482,162,889,000106,945,0002,326,528
6Oct 29, 2025 18:37273,5032,292,176,6162,170,116,00099,959,0002,326,528
7Oct 29, 2025 18:37273,5352,296,056,4472,175,367,00094,972,0002,428,928
8Oct 29, 2025 18:37273,7782,306,032,6042,161,389,000110,968,0002,326,528
9Oct 29, 2025 18:37274,1072,300,051,6992,184,164,00090,923,0002,428,928