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 2, 2026 20:46George SeabridgeGeorge SeabridgeScore: 7,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:466,78066,144,14653,248,0003,029,0002,113,536
2Aug 2, 2026 20:466,95567,685,11655,667,0002,067,0002,113,536
3Aug 2, 2026 20:466,96767,771,01654,790,0003,040,0002,113,536
4Aug 2, 2026 20:466,99268,703,50055,007,0003,034,0002,113,536
5Aug 2, 2026 20:467,14969,243,17157,282,0002,059,0002,113,536
6Aug 2, 2026 20:467,21970,459,78357,871,0002,049,0002,113,536
7Aug 2, 2026 20:467,22869,969,84056,934,0003,059,0002,113,536
8Aug 2, 2026 20:467,24370,240,89557,039,0003,080,0002,113,536
9Aug 2, 2026 20:467,32971,545,69257,722,0003,112,0002,113,536