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 10, 2026 19:12Josu San MartinJosu San MartinScore: 4,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 19:134,15043,554,90733,431,0001,018,0002,113,536
2May 10, 2026 19:134,15342,656,19433,438,0001,040,0002,113,536
3May 10, 2026 19:134,16942,304,23433,546,0001,058,0002,113,536
4May 10, 2026 19:134,17343,640,66533,586,0001,050,0002,113,536
5May 10, 2026 19:134,18441,999,84433,694,0001,040,0002,113,536
6May 10, 2026 19:134,19345,618,50233,728,0001,082,0002,113,536
7May 10, 2026 19:134,21744,129,66733,932,0001,070,0002,113,536
8May 10, 2026 19:134,24242,881,80034,128,0001,086,0002,113,536
9May 10, 2026 19:134,24744,106,08634,191,0001,060,0002,113,536