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 listFeb 28, 2026 19:30wnwnScore: 4,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 19:304,35560,578,41834,141,0002,008,0002,277,376
2Feb 28, 2026 19:304,39464,012,28735,459,0001,013,0002,277,376
3Feb 28, 2026 19:304,43462,642,19734,816,0001,989,0002,498,560
4Feb 28, 2026 19:304,43761,592,51735,828,000995,0002,498,560
5Feb 28, 2026 19:304,44163,187,96134,865,0001,992,0002,277,376
6Feb 28, 2026 19:304,46162,307,50035,026,0002,001,0002,277,376