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:20Joad NacerJoad NacerScore: 4,556Success
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:204,48161,653,98234,179,0003,015,0002,334,720
2Oct 11, 2024 02:204,48860,946,56536,244,0001,006,0002,506,752
3Oct 11, 2024 02:204,49962,287,65935,325,0002,018,0002,510,848
4Oct 11, 2024 02:204,55667,955,97035,824,0001,990,0002,502,656
5Oct 11, 2024 02:204,56265,235,85235,874,0001,993,0002,330,624
6Oct 11, 2024 02:204,57459,777,52534,968,0002,997,0002,506,752