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 listMar 21, 2026 09:41olliecrowolliecrowScore: 5,793Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 21, 2026 18:26Yuriy Lyfenko10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 09:415,71465,982,39643,393,0004,036,0002,424,832
2Mar 21, 2026 09:415,79371,939,74244,074,0004,006,0002,367,488
3Mar 21, 2026 09:415,84775,368,92545,496,0003,033,0002,289,664