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 listMay 11, 2026 00:34Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 00:34043,730,74532,909,0001,096,0002,113,536expected "53686106810473545 ", got "53686106554473545 "
2May 11, 2026 00:34045,972,91132,841,0001,076,0002,113,536expected "53689706319903654 ", got "53689705807903654 "
3May 11, 2026 00:344,05041,202,20332,544,0001,079,0002,113,536
4May 11, 2026 00:344,05341,296,26432,558,0001,088,0002,113,536
5May 11, 2026 00:344,05943,540,86932,622,0001,075,0002,113,536
6May 11, 2026 00:344,09043,950,06532,851,0001,097,0002,113,536
7May 11, 2026 00:344,09142,545,53432,885,0001,073,0002,113,536
8May 11, 2026 00:344,09541,831,19232,909,0001,085,0002,113,536
9May 11, 2026 00:344,10542,784,60232,954,0001,123,0002,113,536