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 1, 2023 21:41sliceteamsliceteamScore: 14,931Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2023 21:4114,836197,976,382123,139,37802,273,280
2Oct 1, 2023 21:4114,861187,085,538123,349,19402,277,376
3Oct 1, 2023 21:4114,864177,883,570123,370,64602,240,512
4Oct 1, 2023 21:4114,920151,975,826122,831,0001,006,0002,387,968
5Oct 1, 2023 21:4114,921153,747,735121,847,0001,997,0002,260,992
6Oct 1, 2023 21:4114,928152,081,052121,904,0001,998,0002,396,160
7Oct 1, 2023 21:4114,931153,630,242122,926,000999,0002,523,136
8Oct 1, 2023 21:4114,933148,442,583122,949,000999,0002,387,968
9Oct 1, 2023 21:4114,939152,866,787121,997,0001,999,0002,260,992
10Oct 1, 2023 21:4114,943153,353,885122,030,0002,000,0002,260,992
11Oct 1, 2023 21:4115,013151,146,894123,600,0001,004,0002,494,464
12Oct 1, 2023 21:4115,120146,946,757124,496,0001,004,0002,392,064