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 16:01Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 00:12Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 00:12042,642,06033,486,0001,011,0002,117,632expected "74600294196621100 ", got "22121978161966892 "
2Jul 7, 2026 00:12042,447,53833,265,0001,197,0002,117,632expected "74600294196621100 ", got "20553046321936913 "
3Jul 7, 2026 00:12043,848,21134,074,0001,102,0002,117,632expected "74600294196621100 ", got "20553046321455944 "
4Apr 18, 2026 16:014,34162,899,71734,031,0002,001,0002,469,888
5Apr 18, 2026 16:014,34957,602,57534,090,0002,005,0002,535,424
6Apr 18, 2026 16:014,36255,289,46834,196,0002,011,0002,482,176