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 listMar 7, 2024 04:52Huy Duc LeHuy Duc LeScore: 12,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 04:5212,203129,300,49999,280,0002,005,0002,285,568
2Mar 7, 2024 04:5212,210127,070,98899,335,0002,006,0002,519,040
3Mar 7, 2024 04:5212,212121,451,702101,356,00002,281,472
4Mar 7, 2024 04:5212,212127,496,426100,359,0001,003,0002,527,232
5Mar 7, 2024 04:5212,214125,718,11899,373,0002,007,0002,277,376
6Mar 7, 2024 04:5212,216131,275,85799,382,0002,007,0002,269,184
7Mar 7, 2024 04:5212,218130,162,52099,399,0002,008,0002,519,040
8Mar 7, 2024 04:5212,225128,295,52399,479,0001,989,0002,285,568
9Mar 7, 2024 04:5212,269128,010,180100,833,000998,0002,285,568
10Mar 7, 2024 04:5212,323156,958,538102,283,93902,285,568
11Mar 7, 2024 04:5212,784156,643,116106,108,06302,285,568
12Mar 7, 2024 04:5212,786164,190,802106,122,30102,293,760