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 27, 2022 10:00PhibPhibError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2022 09:5800000Error: Killed by timeout
2Sep 27, 2022 09:5900000Error: No answer to stdout. Died or killed?
3Sep 27, 2022 09:5962,503579,743,602518,774,71002,191,360
4Sep 27, 2022 09:5962,530578,647,946519,002,46102,191,360
5Sep 27, 2022 09:5962,537577,884,630519,053,03202,195,456
6Sep 27, 2022 10:0062,813587,414,408521,349,05802,256,896
7Sep 27, 2022 10:0062,892597,645,576522,003,14702,256,896
8Sep 27, 2022 10:0062,954587,867,879522,516,83902,256,896