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 listApr 26, 2026 15:28wnwnScore: 3,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:293,42548,863,29127,416,0001,015,0002,498,560
2Apr 26, 2026 15:293,43849,964,22427,517,0001,019,0002,490,368
3Apr 26, 2026 15:293,45344,970,28227,644,0001,023,0002,486,272
4Apr 26, 2026 15:293,45545,411,44027,659,0001,024,0002,486,272
5Apr 26, 2026 15:293,47647,884,83226,864,0001,989,0002,486,272
6Apr 26, 2026 15:293,48348,266,05027,914,000996,0002,486,272
7Apr 26, 2026 15:293,55046,702,47628,452,0001,016,0002,330,624
8Apr 26, 2026 15:293,59646,700,29727,864,0001,990,0002,494,464
9Apr 26, 2026 15:293,62445,309,77728,082,0002,005,0002,482,176