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 listOct 1, 2026 17:03Karthik ReddyKarthik ReddyError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 17:030143,425,991132,175,0002,173,00024,576expected "53684509143608889 ", got "53684509143608889 2 2 278 26325 51 1|4 27170 255 26108 260 26131 259 26091 |133397 "
2Oct 1, 2026 17:030144,104,836132,853,0002,182,00024,576expected "53689428689797280 ", got "53689428689797280 2 3 268 26472 54 1|4 27278 256 26237 261 26253 258 26263 |134070 "
3Oct 1, 2026 17:030144,099,226132,867,0002,190,00024,576expected "53685303288785875 ", got "53685303288785875 2 2 266 26467 51 1|4 27334 259 26248 261 26244 261 26238 |134096 "