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 listMay 11, 2025 23:07cures1cures1Score: 424,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2025 23:07423,5523,542,905,3703,428,546,00086,937,0002,289,664
2May 11, 2025 23:07423,9403,547,357,3753,440,729,00077,971,0002,281,472
3May 11, 2025 23:07423,9413,546,800,9873,438,760,00079,947,0002,289,664
4May 11, 2025 23:07423,9633,543,245,0273,434,943,00083,949,0002,289,664
5May 11, 2025 23:07424,1833,544,671,8003,449,744,00070,974,0002,281,472
6May 11, 2025 23:07424,2333,545,324,1643,449,171,00071,961,0002,281,472
7May 11, 2025 23:07424,4173,551,185,5343,448,687,00073,971,0002,506,752
8May 11, 2025 23:07432,4693,621,707,4663,510,525,00078,966,0002,506,752
9May 11, 2025 23:07435,0623,638,387,2463,534,059,00076,957,0002,510,848