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 11, 2024 01:46Joad NacerJoad NacerScore: 4,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 01:464,48758,015,24334,220,0003,019,0002,510,848
2Oct 11, 2024 01:464,49666,280,33234,294,0003,025,0002,510,848
3Oct 11, 2024 01:464,50066,480,45034,320,0003,028,0002,363,392
4Oct 11, 2024 01:464,55766,140,88836,831,000995,0002,506,752
5Oct 11, 2024 01:464,56861,310,42335,918,0001,995,0002,330,624
6Oct 11, 2024 01:464,57061,474,12035,933,0001,996,0002,506,752