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 listMay 10, 2026 09:58wnwnScore: 3,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 09:583,43942,613,19027,479,0001,070,0002,482,176
2May 10, 2026 09:583,50543,927,09928,003,0001,095,0002,486,272
3May 10, 2026 09:583,53846,438,70728,284,0001,089,0002,482,176
4May 10, 2026 09:583,53943,458,49628,321,0001,060,0002,478,080
5May 10, 2026 09:583,54444,828,20828,347,0001,069,0002,482,176
6May 10, 2026 09:583,54646,641,86228,368,0001,068,0002,486,272
7May 10, 2026 09:583,55645,428,53728,447,0001,074,0002,482,176
8May 10, 2026 09:583,56847,367,06528,521,0001,094,0002,486,272
9May 10, 2026 09:583,56948,005,21328,543,0001,086,0002,473,984