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 listJul 16, 2026 08:10wnwnScore: 3,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 08:103,28435,418,07826,247,0001,014,0002,113,536
2Jul 16, 2026 08:103,29335,472,34426,304,0001,028,0002,113,536
3Jul 16, 2026 08:103,29635,281,73626,320,0001,042,0002,113,536
4Jul 16, 2026 08:103,30135,488,38226,353,0001,046,0002,113,536
5Jul 16, 2026 08:103,31435,454,99226,463,0001,045,0002,113,536
6Jul 16, 2026 08:103,33035,707,88126,629,0001,010,0002,113,536
7Jul 16, 2026 08:103,45837,416,74027,693,0001,014,0002,113,536
8Jul 16, 2026 08:103,48936,983,75027,925,0001,039,0002,113,536
9Jul 16, 2026 08:103,49437,101,49227,955,0001,051,0002,113,536