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 14, 2024 16:02Joad NacerJoad NacerScore: 4,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 16:024,57956,958,13235,006,0003,000,0002,273,280
2Oct 14, 2024 16:024,60761,737,70336,230,0002,012,0002,535,424
3Oct 14, 2024 16:024,62559,751,47135,360,0003,030,0002,306,048
4Oct 14, 2024 16:024,67868,005,68836,840,0001,991,0002,531,328
5Oct 14, 2024 16:024,68065,479,04038,840,00002,531,328
6Oct 14, 2024 16:024,71267,198,03737,108,0002,005,0002,531,328