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 19, 2026 21:21lipapipalipapipaScore: 5,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 21:215,79070,964,38546,058,0002,002,0002,363,392
2Feb 19, 2026 21:215,82169,517,88146,302,0002,013,0002,371,584
3Feb 19, 2026 21:215,85575,039,91347,584,0001,012,0002,363,392
4Feb 19, 2026 21:215,89173,979,74445,900,0002,993,0002,519,040
5Feb 19, 2026 21:215,95371,155,20648,399,0001,008,0002,285,568
6Feb 19, 2026 21:215,95971,665,66547,438,0002,018,0002,375,680