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 11:44wnwnError
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 11:440799,676,375779,773,0001,154,0002,113,536expected "53690485629345147 ", got "18446744073709551025 53690485629345147 524138076 0 9941 10094 10299 10607 10086 9887 10412 10438 27756 27510 27372 29244 27713 28652 "
2Sep 24, 2026 11:440746,807,756736,296,0001,024,0002,113,536expected "53691273874578232 ", got "18446744073709551025 53691273874578232 524135899 0 9997 10001 10255 10258 9997 10008 10257 10281 26087 26088 26082 26754 26097 26802 "
3Sep 24, 2026 11:440801,777,734781,517,0001,070,0002,113,536expected "53690059409463355 ", got "18446744073709551025 53690059409463355 524133278 0 10104 9974 10313 10248 10274 9985 10376 10419 27483 27609 27576 28507 27940 28496 "