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:11wnwnError
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:110749,462,048739,466,0001,088,0002,113,536expected "53685701485949254 ", got "18446744073709551045 53685701485949254 524129128 0 9980 9990 10040 10009 10003 9988 9970 10003 26406 26386 26358 26474 26368 26371 "
2Sep 24, 2026 17:110743,314,252733,331,0001,054,0002,113,536expected "53682704207896853 ", got "18446744073709551045 53682704207896853 524127174 0 9994 9999 10016 10021 9977 10004 10002 9988 26143 26123 26115 26175 26120 26128 "
3Sep 24, 2026 17:110748,743,869738,375,0001,017,0002,113,536expected "53690996424616254 ", got "18446744073709551045 53690996424616254 524134946 0 10004 10000 10009 10016 9999 10011 9999 10001 26299 26290 26297 26343 26307 26290 "