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 listJan 3, 2025 07:03Rohan KapurRohan KapurScore: 391,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2025 07:03390,1303,271,806,7033,172,120,00065,960,0002,285,568
2Jan 3, 2025 07:03390,5073,270,945,3713,169,244,00071,960,0002,289,664
3Jan 3, 2025 07:03390,8063,272,730,1333,179,738,00063,954,0002,285,568
4Jan 3, 2025 07:03390,8463,271,378,0153,173,043,00070,978,0002,375,680
5Jan 3, 2025 07:03391,1113,270,802,1613,177,261,00068,962,0002,281,472
6Jan 3, 2025 07:03391,4203,280,215,3383,189,808,00058,977,0002,285,568
7Jan 3, 2025 07:03391,5843,277,706,2013,184,189,00065,962,0002,289,664
8Jan 3, 2025 07:03391,8533,278,521,4053,188,415,00063,968,0002,367,488
9Jan 3, 2025 07:03393,9233,303,646,2413,215,585,00053,976,0002,285,568