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 9, 2026 12:23wnwnScore: 3,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 12:233,37243,040,31526,927,0001,067,0002,486,272
2May 9, 2026 12:233,37645,324,79326,963,0001,063,0002,482,176
3May 9, 2026 12:233,37946,281,99027,000,0001,053,0002,486,272
4May 9, 2026 12:233,49645,434,81727,961,0001,064,0002,486,272
5May 9, 2026 12:233,54646,059,86128,355,0001,077,0002,482,176
6May 9, 2026 12:233,55943,003,84528,478,0001,067,0002,486,272
7May 9, 2026 12:233,56544,532,13128,486,0001,111,0002,490,368
8May 9, 2026 12:233,57445,044,05128,576,0001,089,0002,482,176
9May 9, 2026 12:233,60042,817,93428,763,0001,122,0002,478,080