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 listApr 18, 2026 21:58Yuriy LyfenkoYuriy LyfenkoScore: 4,317Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 21:584,27856,457,15934,495,0001,014,0002,473,984
2Apr 18, 2026 21:584,29359,687,62734,618,0001,018,0002,469,888
3Apr 18, 2026 21:584,29662,705,98734,642,0001,018,0002,535,424
4Apr 18, 2026 21:584,29964,359,20634,666,0001,019,0002,269,184
5Apr 18, 2026 21:584,31759,757,85034,835,000995,0002,535,424
6Apr 18, 2026 21:584,31864,222,49134,843,000995,0002,535,424
7Apr 18, 2026 21:584,31964,885,87734,850,000995,0002,469,888
8Apr 18, 2026 21:584,32263,320,00834,845,0001,024,0002,535,424
9Apr 18, 2026 21:584,32958,314,66134,934,000998,0002,269,184