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 14, 2026 23:11Tomislav TunkovicTomislav TunkovicError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 16, 2026 03:22Andrew Epstein55.42CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 04:200191,796,576181,759,0001,005,0002,121,728expected "10925639026434100 ", got "1450712161129610421 "stderr
2Oct 16, 2026 04:2017,553154,674,010144,525,0001,172,0002,121,728stderr
3Oct 16, 2026 04:2017,575155,056,236144,729,0001,150,0002,121,728stderr
4Aug 14, 2026 23:1118,027158,073,753148,623,0001,004,0002,121,728stderr
5Aug 14, 2026 23:1118,045158,068,009148,747,0001,027,0002,121,728stderr
6Aug 14, 2026 23:1118,057158,286,327148,868,0001,006,0002,121,728stderr