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 8, 2023 20:27sliceteamsliceteamScore: 16,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 8, 2023 20:2714,934180,264,093123,948,56202,273,280
2Oct 8, 2023 20:2714,936189,903,554123,966,82302,269,184
3Oct 8, 2023 20:2714,965182,863,999124,213,14102,265,088
4Oct 8, 2023 20:2716,451161,328,767135,542,0001,004,0002,260,992
5Oct 8, 2023 20:2716,556164,219,258137,412,00002,260,992
6Oct 8, 2023 20:2716,557158,577,344137,425,00002,260,992
7Oct 8, 2023 20:2716,564160,293,929136,479,0001,003,0002,260,992
8Oct 8, 2023 20:2716,594163,160,870135,737,0001,996,0002,523,136
9Oct 8, 2023 20:2716,608162,702,412135,849,0001,997,0002,523,136
10Oct 8, 2023 20:2716,615163,856,598135,906,0001,998,0002,383,872
11Oct 8, 2023 20:2716,633168,847,535137,051,0001,000,0002,383,872
12Oct 8, 2023 20:2716,871168,862,573138,028,0002,000,0002,260,992