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 listNov 3, 2026 11:10Andrew EpsteinAndrew EpsteinScore: 104,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 11:10104,428876,187,671863,540,0003,216,0002,134,016stderr
2Nov 3, 2026 11:10104,552877,682,645865,711,0002,074,0002,134,016stderr
3Nov 3, 2026 11:10104,571877,754,242865,889,0002,053,0002,134,016stderr
4Nov 3, 2026 11:10104,623878,098,874865,118,0003,257,0002,134,016stderr
5Nov 3, 2026 11:10104,651877,932,525865,552,0003,059,0002,134,016stderr
6Nov 3, 2026 11:10104,688878,756,822866,849,0002,065,0002,134,016stderr
7Nov 3, 2026 11:10104,750879,229,234866,340,0003,085,0002,134,016stderr
8Nov 3, 2026 11:10104,819879,814,938867,950,0002,049,0002,129,920stderr
9Nov 3, 2026 11:10104,879880,288,629868,324,0002,173,0002,129,920stderr