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 13, 2026 03:36olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 27, 2026 12:01wn10.00RecheckSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 12:01027,502,1318,219,0001,027,000397,312Exit with code 1:
2Mar 13, 2026 03:362,88845,194,83022,971,000998,0002,273,280
3Mar 13, 2026 03:362,88845,601,88022,976,000998,0002,506,752
4Mar 13, 2026 03:362,88944,062,04222,980,000999,0002,273,280