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 20:30Josu San MartinJosu San MartinScore: 4,284Success
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 20:304,28043,983,31034,494,0001,034,0002,113,536
2Aug 30, 2026 20:304,28145,439,71034,488,0001,048,0002,113,536
3Aug 30, 2026 20:304,28344,080,22034,519,0001,032,0002,113,536
4Aug 30, 2026 20:304,28344,035,88334,518,0001,039,0002,113,536
5Aug 30, 2026 20:304,28444,004,21234,518,0001,047,0002,113,536
6Aug 30, 2026 20:304,28544,059,12134,537,0001,036,0002,113,536
7Aug 30, 2026 20:304,28744,047,35834,549,0001,037,0002,113,536
8Aug 30, 2026 20:304,29244,102,66534,576,0001,048,0002,113,536
9Aug 30, 2026 20:304,29844,121,32334,543,0001,132,0002,113,536