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 10, 2026 09:03wnwnScore: 3,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 09:043,29835,343,78926,346,0001,029,0002,113,536
2Jul 10, 2026 09:043,32335,710,13426,581,0001,008,0002,113,536
3Jul 10, 2026 09:043,33835,776,58426,604,0001,102,0002,113,536
4Jul 10, 2026 09:043,34635,708,01126,751,0001,025,0002,113,536
5Jul 10, 2026 09:043,35435,946,55326,823,0001,022,0002,113,536
6Jul 10, 2026 09:043,49737,618,79627,995,0001,034,0002,113,536
7Jul 10, 2026 09:043,50737,177,37928,114,0001,002,0002,113,536
8Jul 10, 2026 09:043,51537,722,12428,166,0001,014,0002,113,536
9Jul 10, 2026 09:043,53637,698,39928,338,0001,013,0002,113,536