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 listSep 25, 2022 14:59aaavrcaaavrcScore: 1,641,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2022 15:131,640,43813,673,183,61113,615,634,56902,260,992
2Sep 25, 2022 15:131,641,45513,689,304,22213,624,073,48602,256,896
3Sep 25, 2022 14:591,641,55713,688,987,26813,624,923,12502,256,896
4Sep 25, 2022 14:591,641,62813,680,012,32913,625,510,84802,265,088
5Sep 25, 2022 15:131,652,80113,794,268,48713,718,249,38702,248,704
6Sep 25, 2022 14:591,652,80913,779,953,01713,718,315,70502,252,800