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 10, 2026 17:19Victor MerckléVictor MerckléScore: 4,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 17:204,53145,837,36836,512,0001,103,0002,117,632stderr
2Aug 10, 2026 17:204,53147,086,77936,490,0001,119,0002,117,632stderr
3Aug 10, 2026 17:204,53445,846,29036,530,0001,107,0002,117,632stderr
4Aug 10, 2026 17:204,53846,088,87336,593,0001,075,0002,117,632stderr
5Aug 10, 2026 17:204,54246,139,86636,588,0001,118,0002,117,632stderr
6Aug 10, 2026 17:204,54745,897,30736,722,0001,023,0002,117,632stderr
7Aug 10, 2026 17:204,55346,443,02536,676,0001,119,0002,117,632stderr
8Aug 10, 2026 17:204,55545,980,72236,757,0001,051,0002,117,632stderr
9Aug 10, 2026 17:204,56346,025,29236,868,0001,007,0002,117,632stderr