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 listOct 5, 2026 09:21Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 09:2103,455,652,800445,515,0001,147,0002,113,536expected "53691350970120473 ", got " A25960 c1825651 b4s036513 b4s829731 b4s230999 A25723 c1825625 b4s036509 b4s829283 b4s230653 A25730 c1825624 b4s036495 b4s829287 b4s230643 "
2Oct 5, 2026 09:2103,454,582,836444,515,0001,128,0002,113,536expected "53690331614498015 ", got " A25947 c1825602 b4s036491 b4s829239 b4s230900 A25653 c1825588 b4s036542 b4s829275 b4s230556 A25640 c1825581 b4s036504 b4s829246 b4s230552 "
3Oct 5, 2026 09:2103,453,841,173443,618,0001,094,0002,113,536expected "53686198158809115 ", got " A25845 c1825571 b4s036426 b4s829197 b4s230506 A25645 c1825564 b4s036421 b4s829193 b4s230521 A25666 c1825556 b4s036580 b4s829343 b4s230501 "