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 14, 2026 14:36Josu 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 14, 2026 14:36043,374,10032,463,0001,127,0002,113,536expected "53691237284567226 ", got "53691237186692554 "
2May 14, 2026 14:36043,191,92932,839,0001,087,0002,113,536expected "53687764934780174 ", got "53687762948665062 "
3May 14, 2026 14:364,02640,716,66532,394,0001,023,0002,113,536
4May 14, 2026 14:364,03241,565,44332,428,0001,038,0002,113,536
5May 14, 2026 14:364,03541,706,81832,438,0001,058,0002,113,536
6May 14, 2026 14:364,03542,527,02332,410,0001,088,0002,113,536
7May 14, 2026 14:364,07941,210,02632,760,0001,097,0002,113,536
8May 14, 2026 14:364,10741,748,88832,982,0001,108,0002,113,536
9May 14, 2026 14:367,39068,591,27860,266,0001,077,0002,113,536