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 10, 2024 12:11Joad NacerJoad NacerScore: 7,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 12:117,59686,324,00762,043,0001,000,0002,273,280
2Oct 10, 2024 12:117,59983,561,60362,074,0001,001,0002,433,024
3Oct 10, 2024 12:117,60390,993,31761,105,0002,003,0002,437,120
4Oct 10, 2024 12:117,90990,242,36265,642,00002,531,328
5Oct 10, 2024 12:117,95787,351,83965,040,0001,000,0002,531,328
6Oct 10, 2024 12:1110,102105,916,30681,854,0001,996,0002,428,928