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 5, 2026 13:08wnwnScore: 3,307Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:093,29435,861,66826,314,0001,028,0002,113,536
2Sep 5, 2026 13:093,29535,787,85126,321,0001,028,0002,113,536
3Sep 5, 2026 13:093,29835,671,84826,344,0001,037,0002,113,536
4Sep 5, 2026 13:093,29935,959,13326,344,0001,043,0002,113,536
5Sep 5, 2026 13:093,30735,882,07126,327,0001,123,0002,113,536
6Sep 5, 2026 13:093,30835,925,36726,436,0001,026,0002,113,536
7Sep 5, 2026 13:093,31836,000,25726,533,0001,007,0002,113,536
8Sep 5, 2026 13:093,50037,502,67928,053,0001,004,0002,113,536
9Sep 5, 2026 13:093,52138,396,68328,187,0001,044,0002,113,536