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 16, 2024 23:44Joad NacerJoad NacerScore: 4,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 23:444,50062,718,98836,342,0001,009,0002,310,144
2Oct 16, 2024 23:444,53260,101,06336,599,0001,016,0002,301,952
3Oct 16, 2024 23:444,56262,938,12234,873,0002,989,0002,314,240
4Oct 16, 2024 23:444,59657,264,81837,146,0001,003,0002,531,328
5Oct 16, 2024 23:444,67163,442,53237,774,000994,0002,531,328
6Oct 16, 2024 23:444,86791,729,74639,388,0001,009,0002,269,184