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 listAug 9, 2026 17:45TonyTonyScore: 5,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2026 17:455,51656,499,66543,008,0002,783,0002,113,536
2Aug 9, 2026 17:455,52055,768,81643,103,0002,714,0002,113,536
3Aug 9, 2026 17:455,52755,868,06143,182,0002,695,0002,113,536
4Aug 9, 2026 17:455,55356,086,37044,050,0002,040,0002,113,536
5Aug 9, 2026 17:455,60756,609,44444,508,0002,038,0002,113,536
6Aug 9, 2026 17:455,62156,669,58244,597,0002,058,0002,113,536
7Aug 9, 2026 17:455,62457,397,95844,633,0002,051,0002,113,536
8Aug 9, 2026 17:455,65557,146,65444,154,0002,787,0002,113,536
9Aug 9, 2026 17:455,68657,179,38945,105,0002,096,0002,113,536