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 listSep 24, 2024 09:01Ilango RajagopalIlango RajagopalScore: 92,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2024 09:0191,171779,733,728577,787,000178,934,0002,383,872
2Sep 24, 2024 09:0191,369783,126,898578,511,000179,848,0002,482,176
3Sep 24, 2024 09:0191,723786,821,699578,468,000182,832,0002,322,432
4Sep 24, 2024 09:0191,996787,212,424579,670,000183,895,0002,457,600
5Sep 24, 2024 09:0192,078790,409,433578,428,000185,816,0002,408,448
6Sep 24, 2024 09:0192,101794,337,673578,578,000185,864,0002,437,120
7Sep 24, 2024 09:0192,270793,868,469578,882,000186,962,0002,383,872
8Sep 24, 2024 09:0192,282798,805,397579,957,000185,986,0002,457,600
9Sep 24, 2024 09:0192,884797,359,115578,955,000191,985,0002,461,696