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:38wnwnError
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:400583,707,405572,131,0001,101,0002,113,536expected "53693515943459803 ", got "18446744073709551011 53693515943459803 524136757 0 10007 11287 11036 11043 11319 10006 26355 26345 "
2Sep 24, 2026 08:400582,637,419572,732,0001,086,0002,113,536expected "53689266585706481 ", got "18446744073709551011 53689266585706481 524132689 0 9993 11299 11029 11022 11258 9997 26394 26395 "
3Sep 24, 2026 08:400584,652,611574,866,0001,009,0002,113,536expected "53692461137103461 ", got "18446744073709551011 53692461137103461 524135116 0 9999 11199 10923 10923 11197 10009 26561 26548 "