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 4, 2025 09:31Paul KhadimPaul KhadimScore: 54,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2025 09:3154,262483,396,081395,326,00055,045,0002,273,280
2Mar 4, 2025 09:3154,281472,961,041394,594,00055,942,0002,281,472
3Mar 4, 2025 09:3154,281481,164,629396,592,00053,944,0002,289,664
4Mar 4, 2025 09:3154,308475,183,002394,790,00055,970,0002,277,376
5Mar 4, 2025 09:3154,373479,050,519393,261,00058,038,0002,277,376
6Mar 4, 2025 09:3154,413473,077,729386,682,00064,946,0002,396,160
7Mar 4, 2025 09:3154,490479,638,583390,233,00062,037,0002,281,472
8Mar 4, 2025 09:3154,503480,403,661394,325,00058,047,0002,289,664
9Mar 4, 2025 09:3154,649473,282,126378,655,00074,931,0002,273,280