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 24, 2024 08:58Ilango RajagopalIlango RajagopalScore: 133,285Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2024 08:58132,7541,126,823,450922,882,000178,977,0002,281,472
2Sep 24, 2024 08:58133,1111,130,580,761921,852,000182,970,0002,461,696
3Sep 24, 2024 08:58133,1741,133,940,661920,457,000184,891,0002,428,928
4Sep 24, 2024 08:58133,2831,132,063,568921,372,000184,874,0002,314,240
5Sep 24, 2024 08:58133,2851,135,362,652922,391,000183,878,0002,371,584
6Sep 24, 2024 08:58133,3721,131,635,791921,155,000185,829,0002,428,928
7Sep 24, 2024 08:58133,3971,135,057,997921,331,000185,865,0002,449,408
8Sep 24, 2024 08:58133,4631,136,451,328922,786,000184,957,0002,412,544
9Sep 24, 2024 08:58134,3531,145,191,734921,282,000193,849,0002,465,792