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 listApr 25, 2024 02:15Steve HanSteve HanScore: 70,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2024 02:1663,694596,627,141528,657,67202,265,088
2Apr 25, 2024 02:1663,795590,163,013529,501,00502,273,280
3Apr 25, 2024 02:1663,829593,470,017529,783,60502,277,376
4Apr 25, 2024 02:0770,809640,327,497587,712,40802,285,568
5Apr 25, 2024 02:0770,930663,225,121588,719,90102,269,184
6Apr 25, 2024 02:0773,388679,916,407609,123,08402,273,280
7Apr 25, 2024 02:1594,900857,749,002787,673,32002,281,472
8Apr 25, 2024 02:1594,914862,263,240787,787,92702,281,472
9Apr 25, 2024 02:1598,103863,965,445814,252,91802,273,280