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 17:34wnwnError
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 17:340748,727,213738,833,0001,081,0002,113,536expected "53689793061526492 ", got "18446744073709551046 53689793061526492 524133054 0 9997 10008 10064 10071 10077 10101 9971 10003 26304 26277 26291 26469 26517 26277 "
2Sep 24, 2026 17:340742,740,373732,997,0001,062,0002,113,536expected "53690713181345196 ", got "18446744073709551046 53690713181345196 524131772 0 10003 9998 10069 10079 10146 10076 10002 9998 26118 26113 26118 26308 26413 26114 "
3Sep 24, 2026 17:340749,105,162739,321,0001,008,0002,113,536expected "53683206337277893 ", got "18446744073709551046 53683206337277893 524126345 0 9998 10003 10067 10076 10098 10102 9993 10010 26333 26312 26322 26529 26580 26321 "