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:12Karthik 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:12063,754,35053,666,0001,003,00020,480expected "53683636275714078 ", got "53683636275714078 967 2 266 26433 53 1|99 99 99 99 99 99 99 99 99 99 99 99 99 99 93 99 |26206 |53928 "
2Oct 1, 2026 17:12064,129,83655,110,000020,480expected "53693080436227478 ", got "53693080436227478 967 2 261 26833 50 1|93 99 99 99 99 99 99 99 99 99 99 99 99 99 99 99 |26209 |54323 "
3Oct 1, 2026 17:12063,804,59254,805,000020,480expected "53685893767403860 ", got "53685893767403860 967 2 261 26646 52 1|99 99 93 99 99 99 99 99 99 99 99 99 99 99 99 99 |26091 |54020 "