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 13, 2026 18:55Aleksei ShahoikaAleksei ShahoikaScore: 14,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:5614,300129,106,726102,771,00015,919,0002,113,536
2May 13, 2026 18:5614,308127,828,684102,394,00016,369,0002,113,536
3May 13, 2026 18:5614,353131,045,725102,387,00016,751,0002,113,536
4May 13, 2026 18:5614,452129,667,832103,402,00016,553,0002,113,536
5May 13, 2026 18:5614,462129,060,208102,964,00017,077,0002,113,536
6May 13, 2026 18:5614,468129,428,970102,286,00017,804,0002,113,536
7May 13, 2026 18:5614,530129,478,762102,431,00018,174,0002,113,536
8May 13, 2026 18:5614,536132,390,959102,864,00017,790,0002,113,536
9May 13, 2026 18:5614,546129,408,117102,753,00017,987,0002,113,536