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 listJul 17, 2026 20:17Kevin HeaveyKevin HeaveyScore: 3,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 20:413,66940,286,35229,397,0001,056,0002,113,536
2Jul 17, 2026 20:413,68140,389,65329,497,0001,056,0002,113,536
3Jul 17, 2026 20:413,69340,513,56629,609,0001,048,0002,113,536
4Jul 17, 2026 20:413,77341,225,91430,275,0001,045,0002,113,536
5Jul 17, 2026 20:413,91042,343,95831,415,0001,043,0002,113,536
6Jul 17, 2026 20:413,92443,924,90831,534,0001,043,0002,113,536
7Jul 17, 2026 20:413,96244,064,34331,846,0001,042,0002,113,536
8Jul 17, 2026 20:413,97742,883,27031,973,0001,043,0002,113,536
9Jul 17, 2026 20:413,99344,556,64732,103,0001,043,0002,113,536