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 6, 2026 15:13Dominique GarmierDominique GarmierError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 14:27M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:20013,117,8281,226,0001,083,00020,480No answer to stdout. Died or killed?
2May 6, 2026 15:136,64071,611,89054,003,0001,114,0002,465,792
3May 6, 2026 15:136,68372,182,73354,310,0001,161,0002,457,600
4May 6, 2026 15:136,68572,366,27454,276,0001,216,0002,461,696
5May 6, 2026 15:136,73372,500,86154,694,0001,198,0002,465,792
6May 6, 2026 15:136,73573,477,14754,695,0001,208,0002,457,600
7May 6, 2026 15:136,73673,221,98454,694,0001,221,0002,469,888
8May 6, 2026 15:136,73872,984,10154,804,0001,127,0002,461,696
9May 6, 2026 15:136,77975,484,93555,146,0001,122,0002,457,600
10May 6, 2026 15:136,87573,957,85155,859,0001,210,0002,461,696