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 19:50Javid izadiJavid izadiScore: 375,287Success
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 19:50374,3833,133,693,7673,040,414,00066,965,0002,289,664
2Dec 19, 2024 19:50374,6913,141,019,5473,038,960,00070,975,0002,281,472
3Dec 19, 2024 19:50375,2563,139,962,7893,036,656,00077,965,0002,285,568
4Dec 19, 2024 19:50375,2783,138,519,4063,068,824,00045,982,0002,285,568
5Dec 19, 2024 19:50375,2873,145,487,7643,028,940,00085,941,0002,285,568
6Dec 19, 2024 19:50375,7923,148,842,9063,063,109,00055,965,0002,281,472
7Dec 19, 2024 19:50375,8383,144,103,7473,055,486,00063,968,0002,285,568
8Dec 19, 2024 19:50376,4253,147,377,9323,060,359,00063,965,0002,285,568
9Dec 19, 2024 19:50377,7583,163,136,5533,054,433,00080,958,0002,281,472