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 21:58Josu San MartinJosu San MartinScore: 4,227Success
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 22:004,21743,570,42133,976,0001,031,0002,113,536
2Aug 30, 2026 22:004,22343,564,76834,002,0001,050,0002,113,536
3Aug 30, 2026 22:004,22443,533,82034,013,0001,048,0002,113,536
4Aug 30, 2026 22:004,22743,582,01834,049,0001,036,0002,113,536
5Aug 30, 2026 22:004,22743,565,17934,056,0001,034,0002,113,536
6Aug 30, 2026 22:004,23643,635,76634,082,0001,084,0002,113,536
7Aug 30, 2026 22:004,24643,675,40334,205,0001,044,0002,113,536
8Aug 30, 2026 22:004,25743,827,01734,303,0001,034,0002,113,536
9Aug 30, 2026 22:004,33744,463,97834,890,0001,111,0002,113,536