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 6, 2026 21:58TonyTonyScore: 7,926Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2026 21:587,85975,037,19663,108,0002,122,0002,113,536
2Aug 6, 2026 21:587,86474,983,57963,117,0002,155,0002,113,536
3Aug 6, 2026 21:587,88075,235,06663,225,0002,183,0002,113,536
4Aug 6, 2026 21:587,90875,473,08263,475,0002,169,0002,113,536
5Aug 6, 2026 21:587,92675,643,63163,603,0002,184,0002,113,536
6Aug 6, 2026 21:587,93975,594,51463,725,0002,171,0002,113,536
7Aug 6, 2026 21:587,94775,859,40663,759,0002,205,0002,113,536
8Aug 6, 2026 21:587,95075,781,02963,699,0002,290,0002,113,536
9Aug 6, 2026 21:587,96375,991,23263,904,0002,194,0002,113,536