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 13, 2025 05:09Advait IyerAdvait IyerScore: 66,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 05:0766,247579,384,405546,848,0002,999,0002,277,376
2Jan 13, 2025 05:0766,266573,233,086548,004,0002,000,0002,527,232
3Jan 13, 2025 05:0766,267578,929,714548,017,0002,000,0002,523,136
4Jan 13, 2025 05:0766,279579,707,888547,116,0003,000,0002,277,376
5Jan 13, 2025 05:0966,280582,348,147549,127,0001,000,0002,265,088
6Jan 13, 2025 05:0766,282578,870,765547,144,0003,000,0002,269,184
7Jan 13, 2025 05:0766,305578,615,869549,332,0001,000,0002,510,848
8Jan 13, 2025 05:0766,331579,352,329549,550,000999,0002,277,376
9Jan 13, 2025 05:0766,335582,524,870547,582,0002,997,0002,523,136
10Jan 13, 2025 05:0966,336578,413,892549,586,000999,0002,269,184
11Jan 13, 2025 05:0966,336578,891,452546,595,0003,997,0002,355,200
12Jan 13, 2025 05:0766,341583,720,428549,635,000999,0002,281,472