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 15, 2024 00:22Joad NacerJoad NacerScore: 4,631Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 00:224,57562,531,23234,973,0002,997,0002,535,424
2Oct 15, 2024 00:224,59661,217,56935,134,0003,011,0002,338,816
3Oct 15, 2024 00:224,60763,426,42637,232,0001,006,0002,342,912
4Oct 15, 2024 00:224,63161,785,38936,412,0002,022,0002,269,184
5Oct 15, 2024 00:224,72866,353,66937,230,0002,012,0002,338,816
6Oct 15, 2024 00:224,80260,228,23238,862,000996,0002,334,720