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 listNov 28, 2022 18:09apuxbtapuxbtScore: 88,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2022 18:0988,504787,435,123734,583,12102,244,608
2Nov 28, 2022 18:0988,512784,852,866734,648,65702,240,512
3Nov 28, 2022 18:0988,598805,555,632735,363,23002,232,320