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 10, 2026 18:58Josu 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 10, 2026 18:58041,015,25731,168,0001,080,0002,113,536expected "53685543843884872 ", got "53685543587884872 "
2May 10, 2026 18:58040,864,78531,132,0001,082,0002,113,536expected "53684226781649693 ", got "53684226525649693 "
3May 10, 2026 18:583,85839,409,68131,011,0001,011,0002,113,536
4May 10, 2026 18:583,86139,918,50630,974,0001,077,0002,113,536
5May 10, 2026 18:583,86439,622,45130,998,0001,077,0002,113,536
6May 10, 2026 18:583,93542,104,04131,603,0001,064,0002,113,536
7May 10, 2026 18:583,93954,685,18731,565,0001,132,0002,113,536
8May 10, 2026 18:583,97340,642,03331,947,0001,034,0002,113,536
9May 10, 2026 18:587,27575,413,39959,321,0001,064,0002,113,536