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 17, 2024 01:32zielajzielajScore: 3,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2024 01:323,50847,621,30427,110,0002,008,0002,514,944
2Nov 17, 2024 01:323,51752,993,59427,180,0002,013,0002,514,944
3Nov 17, 2024 01:323,51954,802,57526,183,0003,021,0002,375,680
4Nov 17, 2024 01:323,51950,085,70627,196,0002,014,0002,514,944
5Nov 17, 2024 01:323,51949,726,72827,196,0002,014,0002,379,776
6Nov 17, 2024 01:323,52250,434,95027,220,0002,016,0002,375,680
7Nov 17, 2024 01:323,52547,475,16627,243,0002,018,0002,379,776
8Nov 17, 2024 01:323,52652,748,93028,255,0001,009,0002,379,776
9Nov 17, 2024 01:323,52653,688,43328,258,0001,009,0002,379,776
10Nov 17, 2024 01:323,68455,238,74929,561,0001,019,0002,531,328
11Nov 17, 2024 01:323,71658,404,23428,854,0001,989,0002,400,256
12Nov 17, 2024 01:323,71859,479,21528,866,0001,990,0002,265,088