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 20, 2024 03:21zielajzielajScore: 3,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2024 03:253,55650,962,38629,516,00002,514,944
2Nov 20, 2024 03:213,55947,329,73728,522,0001,018,0002,433,024
3Nov 20, 2024 03:253,56456,330,03929,583,00002,338,816
4Nov 20, 2024 03:213,59660,857,54428,852,000994,0002,342,912
5Nov 20, 2024 03:213,59656,056,82028,853,000994,0002,355,200
6Nov 20, 2024 03:253,61756,404,64128,019,0002,001,0002,514,944
7Nov 20, 2024 03:253,68453,396,10830,576,00002,269,184
8Nov 20, 2024 03:213,68557,763,04130,584,00002,355,200
9Nov 20, 2024 03:253,71951,911,25728,875,0001,991,0002,531,328
10Nov 20, 2024 03:213,72752,288,04529,935,000997,0002,453,504
11Nov 20, 2024 03:213,73955,735,91730,036,0001,001,0002,269,184
12Nov 20, 2024 03:253,84751,914,15730,929,000997,0002,351,104