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 15:28wnwnError
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 15:290748,347,314737,953,0001,033,0002,113,536expected "53688707390876755 ", got "18446744073709551040 53688707390876755 524129559 0 9997 9999 10018 10013 9981 9983 10004 10001 26290 26295 26293 26331 26250 26295 "
2Sep 24, 2026 15:290750,883,635741,015,0001,001,0002,113,536expected "53684764894768686 ", got "18446744073709551040 53684764894768686 524130283 0 9988 9996 10069 10002 9946 10055 9996 10003 26407 26406 26397 26504 26409 26395 "
3Sep 24, 2026 15:290754,045,194743,023,0001,062,0002,113,536expected "53686287970163339 ", got "18446744073709551040 53686287970163339 524129913 0 9997 10001 10006 10003 9939 9981 9885 10028 26533 26472 26452 26460 26387 26501 "