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 listAug 30, 2025 21:46Adam FolwarcznyAdam FolwarcznyScore: 9,376Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2025 21:469,153100,047,73749,980,00025,989,0002,322,432
2Aug 30, 2025 21:469,190100,356,95653,491,00022,783,0002,404,352
3Aug 30, 2025 21:469,309102,935,14452,501,00024,764,0002,338,816
4Aug 30, 2025 21:469,337106,038,39852,659,00024,839,0002,269,184
5Aug 30, 2025 21:469,349101,438,00349,739,00027,854,0002,367,488
6Aug 30, 2025 21:469,375106,665,08150,879,00026,936,0002,301,952
7Aug 30, 2025 21:469,376106,352,18751,879,00025,939,0002,379,776
8Aug 30, 2025 21:469,381108,019,27149,910,00027,949,0002,531,328
9Aug 30, 2025 21:469,382107,494,10349,284,00028,584,0002,293,760
10Aug 30, 2025 21:469,400108,888,48954,320,00023,703,0002,392,064
11Aug 30, 2025 21:469,417107,140,23849,472,00028,693,0002,306,048
12Aug 30, 2025 21:469,484105,775,11954,806,00023,915,0002,531,328