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 00:36Joad NacerJoad NacerScore: 5,561Success
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 00:365,45171,187,07842,224,0003,016,0002,514,944
2Oct 11, 2024 00:365,45567,515,94142,257,0003,018,0002,510,848
3Oct 11, 2024 00:365,46268,062,08042,309,0003,022,0002,334,720
4Oct 11, 2024 00:365,56164,322,53844,152,0002,006,0002,330,624
5Oct 11, 2024 00:365,56573,693,62044,179,0002,008,0002,506,752
6Oct 11, 2024 00:365,57973,376,07444,295,0002,013,0002,330,624