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 7, 2026 10:46wnwnScore: 3,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:473,43345,592,49527,428,0001,067,0002,486,272
2May 7, 2026 10:473,43643,546,84727,455,0001,066,0002,490,368
3May 7, 2026 10:473,44043,652,03527,473,0001,080,0002,494,464
4May 7, 2026 10:473,45045,843,26427,576,0001,065,0002,482,176
5May 7, 2026 10:473,45245,281,40927,600,0001,055,0002,486,272
6May 7, 2026 10:473,45742,590,68527,637,0001,061,0002,478,080
7May 7, 2026 10:473,45747,026,04327,598,0001,098,0002,330,624
8May 7, 2026 10:473,46444,996,05327,669,0001,090,0002,494,464
9May 7, 2026 10:473,46643,866,91127,701,0001,068,0002,498,560