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 listDec 21, 2022 01:18Gubin DmitryGubin DmitryScore: 75,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2022 01:1875,682689,594,242628,159,13602,187,264
2Dec 19, 2022 07:4875,684688,823,392628,180,35902,187,264
3Dec 14, 2022 10:0875,688683,904,616628,207,94702,195,456
4Dec 14, 2022 10:0875,688679,918,336628,212,32402,195,456
5Dec 19, 2022 07:4875,688693,978,631628,209,13602,187,264
6Dec 21, 2022 01:1875,696687,845,469628,277,65202,199,552
7Dec 14, 2022 10:0875,701699,483,168628,315,40402,195,456
8Dec 19, 2022 07:4875,701701,436,528628,314,33802,195,456
9Dec 21, 2022 01:1875,705703,159,784628,352,19302,183,168