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 listNov 11, 2024 12:42Anatoly ZhmurAnatoly ZhmurScore: 154,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 12:42154,8461,311,942,2051,229,258,00055,966,0002,314,240
2Nov 11, 2024 12:45154,8831,315,324,3971,228,554,00056,979,0002,289,664
3Nov 11, 2024 12:45154,8971,318,749,3921,224,661,00060,983,0002,314,240
4Nov 11, 2024 12:42154,9031,313,768,4831,227,706,00057,986,0002,293,760
5Nov 11, 2024 12:45154,9561,320,586,6591,226,175,00059,959,0002,289,664
6Nov 11, 2024 12:42155,7071,320,943,4071,231,397,00060,970,0002,306,048