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 08: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 08:2101,318,471,2351,308,488,0001,007,0002,113,536expected "53692429224017679 ", got "18446744073709550815 0 53692429224017679 26413498 26500035 10000 9989 10200 10161 10033 10034 10543 10543 9908 9953 10552 10556 10212 10211 10712 10706 "
2Sep 24, 2026 08:2101,315,133,8611,305,166,0001,114,0002,113,536expected "53691026046367628 ", got "18446744073709550815 0 53691026046367628 26351627 26322069 9995 10003 10386 10266 10030 10049 10646 10642 9989 10000 10645 10635 10271 10279 10741 10755 "
3Sep 24, 2026 08:2101,309,881,6301,299,946,0001,096,0002,113,536expected "53684006603797857 ", got "18446744073709550815 0 53684006603797857 26212472 26217902 9995 9995 10305 10270 10056 10044 10664 10666 9998 10001 10676 10625 10226 10224 10666 10771 "