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 10, 2024 19:48Joad NacerJoad NacerScore: 39,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 19:4839,719354,287,876326,668,0002,996,0002,351,104
2Oct 10, 2024 19:4839,720353,448,908327,675,0001,998,0002,351,104
3Oct 10, 2024 19:4839,770357,940,523328,091,0002,000,0002,490,368