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 21, 2026 21:39M-RochatM-RochatScore: 6,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 21:396,86867,506,25354,624,0002,387,0002,113,536
2May 21, 2026 21:396,87067,149,79654,675,0002,350,0002,113,536
3May 21, 2026 21:396,88968,196,59055,126,0002,057,0002,113,536
4May 21, 2026 21:396,92267,342,52455,380,0002,080,0002,113,536
5May 21, 2026 21:396,93866,992,51355,540,0002,046,0002,113,536
6May 21, 2026 21:396,94468,091,05455,602,0002,040,0002,113,536
7May 21, 2026 21:396,96370,145,62755,766,0002,035,0002,113,536
8May 21, 2026 21:396,98168,314,40855,912,0002,036,0002,113,536
9May 21, 2026 21:396,99167,972,02255,977,0002,055,0002,113,536