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 listSep 12, 2024 14:11Dmitrii KravchenkoDmitrii KravchenkoScore: 43,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2024 14:1143,574389,375,773359,664,0001,998,0002,281,472
2Sep 12, 2024 14:1143,575392,985,705361,672,00002,359,296
3Sep 12, 2024 14:1143,610384,342,429359,963,0001,999,0002,281,472
4Sep 12, 2024 14:1143,635390,260,367361,170,0001,000,0002,281,472
5Sep 12, 2024 14:1143,638385,741,550361,197,0001,000,0002,281,472
6Sep 12, 2024 14:1143,647387,051,265361,268,0001,000,0002,281,472
7Sep 12, 2024 14:1143,647389,075,041361,272,0001,000,0002,338,816
8Sep 12, 2024 14:1143,653391,489,049361,317,0001,000,0002,351,104
9Sep 12, 2024 14:1143,690391,342,320360,632,0001,997,0002,281,472