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:150xAtreides0xAtreidesScore: 368,035Success
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:15367,0633,073,230,1732,955,664,00090,958,0002,285,568
2May 16, 2025 18:15367,2653,075,092,5622,983,337,00064,963,0002,281,472
3May 16, 2025 18:15367,7223,079,783,0293,000,123,00051,967,0002,281,472
4May 16, 2025 18:15367,8443,086,087,8452,991,126,00061,981,0002,285,568
5May 16, 2025 18:15368,0353,086,147,4052,996,715,00057,975,0002,281,472
6May 16, 2025 18:15368,7473,090,027,2852,994,629,00065,969,0002,359,296
7May 16, 2025 18:15368,8403,086,173,6022,995,406,00065,964,0002,285,568
8May 16, 2025 18:15372,1343,116,714,6713,006,750,00081,965,0002,281,472
9May 16, 2025 18:15404,8693,390,785,2733,294,443,00065,968,0002,281,472