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 11, 2026 06:49wnwnScore: 3,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 06:503,28634,478,78427,277,00002,113,536
2May 11, 2026 06:503,29635,129,46326,342,0001,016,0002,113,536
3May 11, 2026 06:503,38335,362,21228,080,00002,113,536
4May 11, 2026 06:503,41236,375,08628,326,00002,113,536
5May 11, 2026 06:503,47538,249,50928,845,00002,113,536
6May 11, 2026 06:503,47837,291,55728,868,00002,113,536
7May 11, 2026 06:503,47937,087,72728,880,00002,113,536
8May 11, 2026 06:503,48039,022,87028,890,00002,113,536
9May 11, 2026 06:503,51438,412,77528,160,0001,009,0002,113,536