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 listOct 27, 2024 00:59Jarry XiaoJarry XiaoScore: 293,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2024 00:59293,2582,460,442,6082,377,064,00056,977,0002,293,760
2Oct 27, 2024 00:59293,3092,471,294,9992,371,502,00062,960,0002,293,760
3Oct 27, 2024 00:59293,3112,465,813,2942,361,531,00072,954,0002,289,664
4Oct 27, 2024 00:59293,5562,469,845,0822,379,547,00056,965,0002,363,392
5Oct 27, 2024 00:59293,5642,468,624,7102,359,623,00076,955,0002,285,568
6Oct 27, 2024 00:59293,6272,465,871,8442,380,124,00056,979,0002,293,760
7Oct 27, 2024 00:59293,7212,463,178,9262,379,909,00057,973,0002,293,760
8Oct 27, 2024 00:59294,1022,469,142,2812,369,077,00071,971,0002,293,760
9Oct 27, 2024 00:59294,1952,466,107,6292,375,852,00065,968,0002,289,664