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 19, 2024 11:57Javid izadiJavid izadiScore: 380,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2024 11:57377,6903,164,892,8743,066,875,00067,952,0002,285,568
2Dec 19, 2024 11:57378,0273,159,278,8673,071,651,00065,971,0002,285,568
3Dec 19, 2024 11:57379,3163,173,821,7123,083,361,00064,965,0002,285,568
4Dec 19, 2024 11:57379,4073,176,743,8753,082,120,00066,959,0002,367,488
5Dec 19, 2024 11:57380,8753,188,532,9873,094,298,00066,963,0002,285,568
6Dec 19, 2024 11:57381,1543,186,366,0493,097,612,00065,970,0002,281,472
7Dec 19, 2024 11:57382,4743,204,438,7213,108,565,00065,969,0002,285,568
8Dec 19, 2024 11:57387,4393,248,236,6683,146,768,00068,973,0002,371,584
9Dec 19, 2024 11:57387,5893,245,510,5813,142,037,00074,953,0002,289,664