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 listMay 3, 2024 10:29Aleksey RopanAleksey RopanScore: 453,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2024 10:29452,1713,813,233,9333,753,019,76202,248,704
2May 3, 2024 10:21452,3023,821,499,2323,754,106,97002,252,800
3May 3, 2024 10:29452,3463,817,204,4393,754,470,13202,236,416
4May 3, 2024 10:29452,3563,813,260,7793,754,558,82302,236,416
5May 3, 2024 10:29453,0203,831,414,6883,760,065,90702,244,608
6May 3, 2024 10:21455,1403,841,130,9273,777,661,70602,240,512
7May 3, 2024 10:21456,8123,850,416,8793,791,539,45002,252,800
8May 3, 2024 10:29462,7373,909,016,4123,840,714,58702,244,608
9May 3, 2024 10:29463,1043,914,647,8513,843,762,21502,240,512