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 7, 2024 16:51Lickety SplitLickety SplitScore: 119,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2024 16:5179,840689,327,347659,670,0002,998,0002,330,624
2Oct 7, 2024 16:51119,7062,627,495,561717,284,000276,272,000253,419,520
3Oct 7, 2024 16:51120,4902,691,033,177711,206,000288,862,000260,046,848