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 listSep 24, 2026 20:21wnwnError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 20:21064,257,33554,291,0001,152,0002,113,536expected "53692626861805398 ", got "18446744073709551054 53692626861805398 524133756 0 3 0 3715410 3713119 3717865 4256820 4254687 4258353 2182204 2179920 2184679 4249011 4246835 4250545 "
2Sep 24, 2026 20:21064,098,49554,296,0001,024,0002,113,536expected "53689770121813010 ", got "18446744073709551054 53689770121813010 524132019 0 3 8 3558429 3562610 3567450 4489234 4485740 4490854 2160554 2158121 2162849 4283902 4280877 4285623 "
3Sep 24, 2026 20:21062,758,99052,941,0001,018,0002,113,536expected "53690917897934862 ", got "18446744073709551054 53690917897934862 524135535 0 3 0 2497293 2494828 2499503 4251431 4247693 4253291 2155908 2153496 2158091 4246946 4243978 4248572 "