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 listMar 20, 2026 00:11olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:45Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:45048,693,06038,058,0001,024,0002,117,632expected "74600294196621100 ", got "55803881393283628 "
2Jul 7, 2026 05:45050,180,86739,478,0001,023,0002,117,632expected "74600294196621100 ", got "55801489206178092 "
3Jul 7, 2026 05:45048,771,84038,153,0001,024,0002,117,632expected "74600294196621100 ", got "55802736400960300 "
4Mar 20, 2026 00:115,77577,994,03343,937,0003,994,0002,506,752
5Mar 20, 2026 00:115,78266,233,00845,988,0001,999,0002,363,392
6Mar 20, 2026 00:115,80774,434,37246,187,0002,008,0002,338,816