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 listSep 9, 2026 13:20Josu 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
1Sep 9, 2026 13:21044,235,41133,855,0001,053,0002,113,536expected "53687416056278359 ", got "53687415800278359 "
2Sep 9, 2026 13:214,10542,711,70933,017,0001,059,0002,113,536
3Sep 9, 2026 13:214,16343,209,15633,519,0001,039,0002,113,536
4Sep 9, 2026 13:214,16543,216,87633,507,0001,064,0002,113,536
5Sep 9, 2026 13:214,16643,208,24733,520,0001,061,0002,113,536
6Sep 9, 2026 13:214,18144,057,30233,658,0001,047,0002,113,536
7Sep 9, 2026 13:214,19143,440,88233,736,0001,051,0002,113,536
8Sep 9, 2026 13:214,24643,926,99934,189,0001,056,0002,113,536
9Sep 9, 2026 13:214,26144,132,61334,306,0001,063,0002,113,536