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, 2025 08:04Suchir KaviSuchir KaviScore: 367,580Success
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, 2025 08:04361,5363,027,907,1692,936,775,00063,973,0002,281,472
2May 10, 2025 08:04361,5463,025,132,0742,924,863,00075,970,0002,285,568
3May 10, 2025 08:04366,1063,064,647,5342,983,702,00054,976,0002,363,392
4May 10, 2025 08:04366,3643,065,970,8752,983,844,00056,977,0002,285,568
5May 10, 2025 08:04367,5803,084,215,9942,991,953,00058,959,0002,285,568
6May 10, 2025 08:04369,8493,096,942,0823,013,773,00055,977,0002,281,472
7May 10, 2025 08:04371,3583,107,211,3473,018,309,00063,964,0002,281,472
8May 10, 2025 08:04371,3673,110,474,7783,015,383,00066,964,0002,285,568
9May 10, 2025 08:04375,4473,151,134,6423,057,244,00058,966,0002,367,488