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 22, 2025 10:24Tan Lip WeiTan Lip WeiScore: 63,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2025 10:2462,657540,230,417459,045,00061,006,0002,457,600
2Oct 22, 2025 10:2462,834550,812,301461,575,00059,944,0002,285,568
3Oct 22, 2025 10:2462,923547,137,220459,354,00062,911,0002,519,040
4Oct 22, 2025 10:2462,939551,178,901460,469,00061,928,0002,510,848
5Oct 22, 2025 10:2463,012547,781,359455,999,00066,999,0002,523,136
6Oct 22, 2025 10:2463,069553,580,697460,533,00062,936,0002,523,136
7Oct 22, 2025 10:2463,092549,192,781457,708,00065,958,0002,285,568
8Oct 22, 2025 10:2463,116545,773,394457,879,00065,982,0002,371,584
9Oct 22, 2025 10:2463,182553,210,664458,488,00065,926,0002,277,376