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 16:47Joad NacerJoad NacerScore: 4,513Success
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 16:474,43563,904,40535,817,000994,0002,351,104
2Oct 11, 2024 16:474,43964,891,95134,850,0001,991,0002,293,760
3Oct 11, 2024 16:474,45564,334,50833,982,0002,998,0002,301,952
4Oct 11, 2024 16:474,51364,363,77334,419,0003,037,0002,289,664
5Oct 11, 2024 16:474,51561,635,97735,450,0002,025,0002,289,664
6Oct 11, 2024 16:474,56265,566,08435,870,0001,992,0002,293,760