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 listSep 29, 2026 10:40wnwnScore: 3,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 10:413,34436,642,01227,760,000020,480
2Sep 29, 2026 10:413,34536,603,38927,766,000020,480
3Sep 29, 2026 10:413,34536,618,77427,764,000020,480
4Sep 29, 2026 10:413,34636,654,76127,780,000020,480
5Sep 29, 2026 10:413,35836,760,49027,873,000020,480
6Sep 29, 2026 10:413,41937,327,57228,385,000020,480
7Sep 29, 2026 10:413,45237,592,42728,653,000020,480
8Sep 29, 2026 10:413,45738,091,00328,700,000020,480
9Sep 29, 2026 10:413,45937,736,06828,714,000020,480