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 24, 2026 04:41wnwnScore: 3,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 04:413,39536,961,11426,998,0001,181,00020,480
2Sep 24, 2026 04:413,39837,016,29527,179,0001,025,0002,113,536
3Sep 24, 2026 04:413,42137,144,95327,170,0001,229,0002,113,536
4Sep 24, 2026 04:413,43637,228,98527,312,0001,215,00020,480
5Sep 24, 2026 04:413,58639,117,16428,646,0001,121,0002,113,536
6Sep 24, 2026 04:413,58739,237,46628,597,0001,178,00020,480
7Sep 24, 2026 04:413,60339,383,92028,665,0001,248,00020,480
8Sep 24, 2026 04:413,61539,353,59928,959,0001,049,0002,113,536
9Sep 24, 2026 04:413,62339,539,35928,866,0001,207,00020,480