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:19TonyTonyScore: 11,535Success
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:2011,290103,438,93991,255,0002,460,0002,113,536
2Aug 2, 2026 20:2011,415104,680,90892,335,0002,415,0002,113,536
3Aug 2, 2026 20:2011,421104,618,87492,205,0002,591,0002,113,536
4Aug 2, 2026 20:2011,440104,824,44192,860,0002,100,0002,113,536
5Aug 2, 2026 20:2011,535105,600,44293,086,0002,655,0002,113,536
6Aug 2, 2026 20:2011,640106,410,49694,050,0002,566,0002,113,536
7Aug 2, 2026 20:2011,792107,671,15095,204,0002,672,0002,113,536
8Aug 2, 2026 20:2011,804107,827,06895,865,0002,109,0002,113,536
9Aug 2, 2026 20:2011,873112,130,61496,101,0002,446,0002,117,632