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 listJan 11, 2025 16:53Advait IyerAdvait IyerScore: 82,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 16:5182,259712,686,995681,748,000999,0002,277,376
2Jan 11, 2025 16:5182,269708,792,721679,836,0002,999,0002,273,280
3Jan 11, 2025 16:5182,284712,382,300681,955,000999,0002,269,184
4Jan 11, 2025 16:5182,317705,754,050682,228,0001,000,0002,265,088
5Jan 11, 2025 16:5382,323711,997,287683,277,00002,277,376
6Jan 11, 2025 16:5182,324716,055,583682,292,0001,000,0002,277,376
7Jan 11, 2025 16:5182,340709,788,783679,426,0003,996,0002,277,376
8Jan 11, 2025 16:5182,349717,902,616681,502,0001,998,0002,277,376
9Jan 11, 2025 16:5182,351710,076,457682,514,000999,0002,277,376
10Jan 11, 2025 16:5382,373708,993,336681,694,0001,999,0002,379,776
11Jan 11, 2025 16:5382,468716,943,639682,489,0001,998,0002,277,376
12Jan 11, 2025 16:5182,547709,361,603682,142,0003,000,0002,277,376