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 12:31wnwnError
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 12:370821,558,662797,411,00015,272,0002,113,536expected "53688425808995912 ", got "18446744073709551029 53688425808995912 25295801896 524128395 0 10025 10246 10776 10749 10746 10770 10255 9996 26998 26994 27675 29088 29002 "
2Sep 24, 2026 12:370826,159,650800,798,00015,880,0002,113,536expected "53690300240871701 ", got "18446744073709551029 53690300240871701 25295935033 524129709 0 9990 10264 10800 10747 10767 10801 10248 9996 27071 27062 27752 29232 29112 "
3Sep 24, 2026 12:370828,581,122805,108,00014,052,0002,113,536expected "53689408089697082 ", got "18446744073709551029 53689408089697082 25295917102 524130668 0 10000 10263 10813 10747 10761 10800 10278 10003 27222 27200 27960 29394 29280 "