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 listFeb 16, 2025 19:06Ian MckibbenIan MckibbenScore: 31,082Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2025 19:0631,067289,145,245256,853,000999,0002,531,328
2Feb 16, 2025 19:0631,069282,063,287256,874,000999,0002,428,928
3Feb 16, 2025 19:0631,075279,210,534256,922,000999,0002,437,120
4Feb 16, 2025 19:0631,077283,103,660256,942,000999,0002,437,120
5Feb 16, 2025 19:0631,082285,768,430256,981,000999,0002,433,024
6Feb 16, 2025 19:0631,090280,346,356256,047,0002,000,0002,531,328
7Feb 16, 2025 19:0631,106284,817,549257,178,0001,000,0002,281,472
8Feb 16, 2025 19:0631,107279,352,870257,191,0001,000,0002,433,024
9Feb 16, 2025 19:0631,117277,630,456256,265,0002,002,0002,269,184