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 14, 2024 16:48Joad NacerJoad NacerScore: 4,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 16:484,31859,036,20633,849,0001,991,0002,273,280
2Oct 14, 2024 16:484,31858,706,31833,850,0001,991,0002,297,856
3Oct 14, 2024 16:484,33757,563,16935,000,0001,000,0002,306,048
4Oct 14, 2024 16:484,36962,751,00934,247,0002,014,0002,306,048
5Oct 14, 2024 16:484,37163,532,71034,261,0002,015,0002,289,664
6Oct 14, 2024 16:484,61657,318,96936,294,0002,016,0002,383,872