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 listOct 15, 2024 15:22Elnur RakhmatullinElnur RakhmatullinScore: 99,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 15:2298,573850,401,009579,401,000238,753,0002,293,760
2Oct 15, 2024 15:2298,648848,545,494580,844,000237,936,0002,269,184
3Oct 15, 2024 15:2298,760844,909,520578,793,000240,913,0002,453,504
4Oct 15, 2024 15:2299,095850,111,104578,640,000243,848,0002,449,408
5Oct 15, 2024 15:2299,170851,353,683579,375,000243,737,0002,465,792
6Oct 15, 2024 15:2299,174859,492,448579,399,000243,747,0002,449,408
7Oct 15, 2024 15:2299,684858,442,384579,562,000247,813,0002,465,792
8Oct 15, 2024 15:2299,963857,646,385579,784,000249,907,0002,371,584
9Oct 15, 2024 15:22100,079862,561,133578,760,000251,895,0002,289,664