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 02:11Joad NacerJoad NacerScore: 4,595Success
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 02:114,52159,176,64835,498,0002,028,0002,506,752
2Oct 11, 2024 02:114,52371,360,89635,511,0002,029,0002,510,848
3Oct 11, 2024 02:114,52765,579,11036,560,0001,015,0002,334,720
4Oct 11, 2024 02:114,59565,821,10736,135,0002,007,0002,330,624
5Oct 11, 2024 02:114,59658,566,98536,139,0002,007,0002,510,848
6Oct 11, 2024 02:114,60662,226,88736,221,0002,012,0002,506,752