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 18, 2026 21:41Aleksei ShahoikaAleksei ShahoikaScore: 13,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 21:4112,948118,283,98286,134,00021,338,0002,113,536
2May 18, 2026 21:4112,954118,098,57186,147,00021,376,0002,113,536
3May 18, 2026 21:4112,969117,182,72586,089,00021,559,0002,113,536
4May 18, 2026 21:4112,972119,077,44186,331,00021,344,0002,113,536
5May 18, 2026 21:4113,007119,598,25086,291,00021,672,0002,113,536
6May 18, 2026 21:4113,020118,446,02786,464,00021,608,0002,113,536
7May 18, 2026 21:4113,024119,150,12986,253,00021,852,0002,113,536
8May 18, 2026 21:4113,048117,752,04286,148,00022,152,0002,113,536
9May 18, 2026 21:4113,101118,113,30786,229,00022,515,0002,113,536