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 listNov 12, 2024 19:13Alexander KosachevAlexander KosachevScore: 75,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2024 19:1374,650644,818,851618,597,000999,0002,486,272
2Nov 12, 2024 19:1374,816640,674,564619,977,000999,0002,478,080
3Nov 12, 2024 19:1374,831647,539,252621,101,00002,531,328
4Nov 12, 2024 19:1375,000650,261,317621,504,000999,0002,527,232
5Nov 12, 2024 19:1375,027647,491,389620,721,0001,999,0002,486,272
6Nov 12, 2024 19:1375,075647,972,951623,123,00002,527,232
7Nov 12, 2024 19:1375,103647,401,015622,359,0001,000,0002,527,232
8Nov 12, 2024 19:1375,129647,932,783622,574,000999,0002,527,232
9Nov 12, 2024 19:1375,138652,515,879621,647,0001,998,0002,482,176