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 listAug 30, 2026 19:48Josu San MartinJosu San MartinScore: 4,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:494,33744,450,61434,920,0001,085,0002,113,536
2Aug 30, 2026 19:494,34244,524,01734,989,0001,056,0002,113,536
3Aug 30, 2026 19:494,34444,502,38835,035,0001,025,0002,113,536
4Aug 30, 2026 19:494,34644,604,45335,025,0001,052,0002,113,536
5Aug 30, 2026 19:494,35944,598,63735,116,0001,066,0002,113,536
6Aug 30, 2026 19:494,36444,653,99135,189,0001,034,0002,113,536
7Aug 30, 2026 19:494,36444,711,19935,146,0001,080,0002,113,536
8Aug 30, 2026 19:494,37144,703,26235,251,0001,030,0002,113,536
9Aug 30, 2026 19:494,39744,960,05635,379,0001,120,0002,113,536