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 listDec 5, 2024 12:39Yingxin JiangYingxin JiangScore: 420,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2024 12:39418,5423,506,861,0073,406,921,00066,978,0002,277,376
2Dec 5, 2024 12:39418,8123,503,391,8343,415,172,00060,967,0002,277,376
3Dec 5, 2024 12:39419,4073,510,930,0823,416,115,00064,964,0002,265,088
4Dec 5, 2024 12:39419,6013,512,168,1073,421,715,00060,977,0002,277,376
5Dec 5, 2024 12:39420,7963,517,281,4083,414,664,00077,946,0002,285,568
6Dec 5, 2024 12:39420,8803,524,810,7653,428,340,00064,968,0002,285,568
7Dec 5, 2024 12:39421,2223,519,905,1683,431,181,00064,965,0002,277,376
8Dec 5, 2024 12:39421,5493,522,887,7693,436,878,00061,979,0002,289,664
9Dec 5, 2024 12:39422,1643,532,459,8623,438,997,00064,962,0002,285,568