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 listFeb 18, 2026 18:27wnwnScore: 7,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:276,25773,171,39050,936,000998,0002,371,584
2Feb 18, 2026 18:276,29078,693,17648,193,0004,016,0002,478,080
3Feb 18, 2026 18:276,43378,031,13250,370,0003,022,0002,461,696
4Feb 18, 2026 18:277,39681,714,52759,377,0002,012,0002,404,352
5Feb 18, 2026 18:277,42992,363,86660,648,0001,010,0002,363,392
6Feb 18, 2026 18:277,61384,975,85662,182,0001,002,0002,408,448