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 5, 2026 22:23TonyTonyScore: 8,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2026 22:238,65181,639,42769,285,0002,525,0002,113,536
2Aug 5, 2026 22:238,67181,835,70369,325,0002,650,0002,113,536
3Aug 5, 2026 22:238,69581,958,45269,503,0002,672,0002,113,536
4Aug 5, 2026 22:238,70882,094,48969,792,0002,489,0002,113,536
5Aug 5, 2026 22:238,71482,152,52669,801,0002,526,0002,113,536
6Aug 5, 2026 22:238,73482,360,48669,785,0002,709,0002,113,536
7Aug 5, 2026 22:238,74682,428,08169,927,0002,669,0002,113,536
8Aug 5, 2026 22:238,74782,382,43169,899,0002,705,0002,113,536
9Aug 5, 2026 22:238,83283,061,29270,659,0002,648,0002,113,536