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, 2024 08:34mahdi739mahdi739Score: 139,307Success
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, 2024 08:34138,1381,179,215,7781,145,546,000999,0002,371,584
2Dec 21, 2024 08:34138,3791,176,324,6801,146,544,0001,999,0002,375,680
3Dec 21, 2024 08:34138,7161,179,909,4331,149,342,0001,998,0002,281,472
4Dec 21, 2024 08:34138,8071,178,068,6471,151,095,000999,0002,285,568
5Dec 21, 2024 08:34139,3071,182,585,4941,154,251,0001,998,0002,285,568
6Dec 21, 2024 08:34139,5131,188,701,9101,157,958,00002,285,568
7Dec 21, 2024 08:34139,5281,186,780,8351,157,085,0001,000,0002,453,504
8Dec 21, 2024 08:34139,8301,184,806,2391,156,591,0003,998,0002,285,568
9Dec 21, 2024 08:34139,8451,182,648,3091,159,714,000999,0002,285,568