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 22, 2025 17:04vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 02:34Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 02:35041,859,73131,661,0002,257,0002,113,536expected "74600294196621100 ", got "46425059381294892 "
2Jul 7, 2026 02:35042,921,83532,228,0002,772,0002,113,536expected "74600294196621100 ", got "46761809116042377 "
3Jul 7, 2026 02:35042,024,85031,715,0002,366,0002,113,536expected "74600294196621100 ", got "46425059381294892 "
4May 22, 2025 17:044,50158,083,45735,336,0002,019,0002,531,328
5May 22, 2025 17:044,53365,401,93935,589,0002,033,0002,527,232
6May 22, 2025 17:044,55964,133,17533,857,0003,983,0002,433,024
7May 22, 2025 17:044,56662,794,72334,909,0002,992,0002,416,640
8May 22, 2025 17:044,57459,898,05733,970,0003,996,0002,531,328
9May 22, 2025 17:044,59357,235,49635,111,0003,009,0002,531,328