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 listJun 7, 2024 17:31GraceGraceScore: 80,169Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 17:3279,775723,888,815662,133,37602,387,968
2Jun 7, 2024 17:3179,790720,834,485662,256,62102,265,088
3Jun 7, 2024 17:3279,825745,128,838662,549,38502,265,088
4Jun 7, 2024 17:3279,868725,773,280662,907,26702,265,088
5Jun 7, 2024 17:3279,970717,031,202663,753,36102,265,088
6Jun 7, 2024 17:3279,990735,195,885663,915,73402,265,088
7Jun 7, 2024 17:3280,169731,591,565665,398,80102,269,184
8Jun 7, 2024 17:3280,240721,657,449665,989,19102,265,088
9Jun 7, 2024 17:3280,277728,135,753666,300,55602,281,472
10Jun 7, 2024 17:3181,894747,936,660679,716,14802,269,184
11Jun 7, 2024 17:3181,969738,419,737680,345,20602,265,088
12Jun 7, 2024 17:3282,141744,602,418681,767,36502,269,184