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 9, 2024 01:58roccoroccoScore: 256,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2024 01:58256,3472,156,469,4182,034,735,00092,942,0002,326,528
2Oct 9, 2024 01:58256,4202,152,838,7722,020,326,000107,963,0002,326,528
3Oct 9, 2024 01:58256,4322,160,165,2962,035,458,00092,929,0002,498,560
4Oct 9, 2024 01:58256,4372,159,634,3282,023,502,000104,922,0002,326,528
5Oct 9, 2024 01:58256,5652,166,358,4792,030,470,00099,022,0002,326,528
6Oct 9, 2024 01:58256,6002,152,224,9052,050,829,00078,954,0002,330,624
7Oct 9, 2024 01:58256,6132,161,120,1052,037,936,00091,952,0002,506,752
8Oct 9, 2024 01:58256,6322,154,953,2442,038,090,00091,958,0002,326,528
9Oct 9, 2024 01:58256,7192,160,633,1762,023,832,000106,938,0002,498,560