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 listFeb 19, 2023 21:44LiamLiamScore: 342,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2023 17:23332,9432,834,105,0942,763,429,21002,195,456
2Feb 19, 2023 21:44335,2242,838,059,4102,782,355,68402,191,360
3Feb 13, 2023 17:23341,5092,899,154,6052,834,526,91902,203,648
4Feb 19, 2023 21:44342,4532,906,629,5792,842,360,56202,199,552
5Feb 13, 2023 17:23342,7832,921,674,4632,845,101,57402,199,552
6Feb 19, 2023 21:44354,0622,999,746,3342,938,715,58002,195,456