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 16, 2025 18:200xAtreides0xAtreidesScore: 245,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2025 18:20244,8012,059,722,7921,970,887,00060,965,0002,285,568
2May 16, 2025 18:20245,0082,059,909,2011,966,580,00066,985,0002,281,472
3May 16, 2025 18:20245,0522,056,417,2671,958,968,00074,960,0002,285,568
4May 16, 2025 18:20245,0922,057,816,6041,972,286,00061,977,0002,285,568
5May 16, 2025 18:20245,8542,062,863,1931,976,598,00063,987,0002,355,200
6May 16, 2025 18:20245,9062,071,214,7531,975,051,00065,968,0002,285,568
7May 16, 2025 18:20246,9592,080,711,8791,985,795,00063,961,0002,285,568
8May 16, 2025 18:20249,0152,091,520,2472,010,857,00055,968,0002,285,568
9May 16, 2025 18:20260,2092,183,833,9862,096,773,00062,963,0002,281,472