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 28, 2025 15:32David-AntunesDavid-AntunesScore: 264,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 15:32263,7692,217,149,2972,096,310,00092,969,0002,326,528
2Jan 28, 2025 15:32263,8482,214,027,7932,089,989,00099,951,0002,498,560
3Jan 28, 2025 15:32263,8502,218,309,0212,096,998,00092,955,0002,490,368
4Jan 28, 2025 15:32263,8542,215,307,5202,087,040,000102,952,0002,490,368
5Jan 28, 2025 15:32264,0582,217,923,0152,098,736,00092,944,0002,494,464
6Jan 28, 2025 15:32264,0712,213,475,1512,099,842,00091,949,0002,494,464
7Jan 28, 2025 15:32264,1392,219,653,6192,088,385,000103,969,0002,326,528
8Jan 28, 2025 15:32264,1432,224,493,5432,068,420,000123,965,0002,326,528
9Jan 28, 2025 15:32264,6972,220,657,7842,097,033,00099,953,0002,326,528