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 listSep 8, 2026 21:20Victor MerckléVictor MerckléScore: 3,491Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 06:20wn10.00CustomSolution Held
Sep 9, 2026 06:20wn10.00CustomSolution Held
Sep 9, 2026 06:14wn10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 21:203,44337,173,22727,419,0001,163,0002,117,632stderr
2Sep 8, 2026 21:203,44937,327,31527,469,0001,161,0002,117,632stderr
3Sep 8, 2026 21:203,45137,263,11227,498,0001,153,0002,117,632stderr
4Sep 8, 2026 21:203,47537,425,50827,694,0001,151,0002,117,632stderr
5Sep 8, 2026 21:203,49137,665,07227,973,0001,010,0002,117,632stderr
6Sep 8, 2026 21:203,52337,787,30028,233,0001,009,0002,117,632stderr
7Sep 8, 2026 21:203,53538,623,45228,339,0001,007,0002,117,632stderr
8Sep 8, 2026 21:203,56638,198,05528,591,0001,012,0002,117,632stderr
9Sep 8, 2026 21:203,56838,227,81428,478,0001,143,0002,117,632stderr