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 listAug 2, 2025 20:30Jack FrigaardJack FrigaardError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 22:00Adam Folwarczny10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 22:07046,897,76136,227,0001,016,0002,113,536expected "27617841214539459 ", got "158608166194558529 "
2Jul 7, 2026 22:07046,810,76536,135,0001,017,0002,113,536expected "27617841214539459 ", got "158608166194558529 "
3Jul 7, 2026 22:07046,924,03036,342,0001,016,0002,113,536expected "27617841214539459 ", got "158608166194558529 "
4Aug 2, 2025 20:304,67665,805,19436,818,0001,990,0002,453,504
5Aug 2, 2025 20:304,67764,823,31235,835,0002,986,0002,519,040
6Aug 2, 2025 20:304,67962,051,04236,844,0001,991,0002,519,040
7Aug 2, 2025 20:304,74160,381,06938,342,0001,009,0002,519,040
8Aug 2, 2025 20:304,74369,031,66337,348,0002,018,0002,519,040
9Aug 2, 2025 20:304,74461,566,69736,350,0003,029,0002,514,944