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 31, 2026 16:42Sergey KintselSergey KintselScore: 395,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2026 16:43394,3023,281,904,0193,209,669,00063,043,0002,117,632
2May 31, 2026 16:43394,5063,283,555,2533,212,353,00062,051,0002,117,632
3May 31, 2026 16:43394,6733,285,181,9113,212,744,00063,048,0002,117,632
4May 31, 2026 16:43395,3613,290,805,5813,217,455,00064,048,0002,117,632
5May 31, 2026 16:43395,4643,292,594,3713,219,318,00063,040,0002,117,632
6May 31, 2026 16:43397,2983,306,835,7453,234,401,00063,173,0002,117,632
7May 31, 2026 16:43397,3223,306,925,2063,234,727,00063,049,0002,117,632
8May 31, 2026 16:43397,6333,309,479,5043,238,311,00062,046,0002,117,632
9May 31, 2026 16:43398,7873,321,898,7723,222,380,00087,557,0002,121,728