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:04Aleksei ShahoikaAleksei ShahoikaScore: 13,753Success
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:0413,690123,471,40091,747,00021,882,0002,113,536
2May 18, 2026 21:0413,708125,738,70491,778,00022,004,0002,113,536
3May 18, 2026 21:0413,720123,585,57492,051,00021,827,0002,113,536
4May 18, 2026 21:0413,743125,616,16091,693,00022,377,0002,113,536
5May 18, 2026 21:0413,753125,915,40791,904,00022,246,0002,113,536
6May 18, 2026 21:0413,769123,744,59591,720,00022,567,0002,113,536
7May 18, 2026 21:0413,803125,609,24591,811,00022,760,0002,113,536
8May 18, 2026 21:0413,826124,290,75592,229,00022,529,0002,113,536
9May 18, 2026 21:0414,010127,668,28291,895,00024,391,0002,113,536