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 12:46Andrew EpsteinAndrew EpsteinScore: 85,533Success
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 12:4785,161716,173,165703,783,0003,058,0002,129,920stderr
2Nov 3, 2026 12:4785,227718,313,618704,378,0003,007,0002,129,920stderr
3Nov 3, 2026 12:4785,240716,765,576704,445,0003,055,0002,129,920stderr
4Nov 3, 2026 12:4785,507719,869,557706,564,0003,152,0002,129,920stderr
5Nov 3, 2026 12:4785,533719,180,914706,888,0003,042,0002,129,920stderr
6Nov 3, 2026 12:4785,535719,310,193706,934,0003,011,0002,129,920stderr
7Nov 3, 2026 12:4785,605719,895,031707,343,0003,181,0002,129,920stderr
8Nov 3, 2026 12:4785,618719,964,422707,575,0003,061,0002,129,920stderr
9Nov 3, 2026 12:4785,847722,831,153709,355,0003,182,0002,129,920stderr