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 listOct 13, 2025 02:53CheranMahalingamCheranMahalingamScore: 50,336Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2025 02:5350,257438,393,283415,136,0002,000,0002,285,568
2Oct 13, 2025 02:5350,279447,055,047416,316,0001,000,0002,277,376
3Oct 13, 2025 02:5350,319441,231,105415,650,0001,998,0002,277,376
4Oct 13, 2025 02:5350,336445,214,172415,788,0001,998,0002,285,568
5Oct 13, 2025 02:5350,336449,191,454415,793,0001,999,0002,277,376
6Oct 13, 2025 02:5350,349440,830,088416,896,000999,0002,285,568
7Oct 13, 2025 02:5350,353445,925,010416,932,000999,0002,281,472
8Oct 13, 2025 02:5350,382443,632,175416,169,0002,000,0002,260,992
9Oct 13, 2025 02:5350,405442,996,462418,360,00002,285,568