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 listFeb 27, 2026 13:34Genos0Genos0Score: 71,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 13:3471,184620,767,123532,844,00057,983,0002,289,664
2Feb 27, 2026 13:3471,221618,336,461530,118,00061,013,0002,383,872
3Feb 27, 2026 13:3471,241622,296,690534,275,00057,029,0002,281,472
4Feb 27, 2026 13:3471,270621,345,141539,581,00051,959,0002,387,968
5Feb 27, 2026 13:3471,274620,057,679535,614,00055,959,0002,289,664
6Feb 27, 2026 13:3471,277618,632,851531,639,00059,959,0002,281,472
7Feb 27, 2026 13:3471,304624,556,953535,844,00055,983,0002,281,472
8Feb 27, 2026 13:3471,407619,135,066538,704,00053,970,0002,289,664
9Feb 27, 2026 13:3471,510622,993,053539,577,00053,957,0002,281,472