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 listJan 30, 2026 03:58Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:45Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:46063,212,50149,944,0003,158,00024,576expected "53668465034051912 ", got "53677233304127222 "
2Sep 9, 2026 10:46073,144,36449,839,00013,183,0002,117,632expected "53671354122818339 ", got "53676939414569840 "
3Sep 9, 2026 10:46064,021,09350,363,0003,571,0002,117,632expected "53676032141444269 ", got "53685776679046298 "
4Jan 30, 2026 03:585,93273,386,05247,226,0002,009,0002,367,488
5Jan 30, 2026 03:586,08072,203,24449,453,0001,009,0002,293,760
6Jan 30, 2026 03:586,09982,546,56550,619,00002,293,760
7Jan 30, 2026 03:586,12081,618,09848,807,0001,992,0002,281,472
8Jan 30, 2026 03:586,26678,300,36750,009,0002,000,0002,367,488
9Jan 30, 2026 03:588,494101,079,26769,495,0001,007,0002,359,296