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 listMay 13, 2026 18:03M-RochatM-RochatScore: 19,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:0419,546171,088,475161,219,0001,021,0002,113,536
2May 13, 2026 18:0419,620171,556,958161,786,0001,067,0002,113,536
3May 13, 2026 18:0419,667172,096,757162,216,0001,021,0002,113,536
4May 13, 2026 18:0419,676172,435,296162,279,0001,039,0002,113,536
5May 13, 2026 18:0419,716175,558,489162,628,0001,019,0002,113,536
6May 13, 2026 18:0419,787175,079,940163,214,0001,024,0002,113,536
7May 13, 2026 18:0419,801173,095,217163,338,0001,017,0002,113,536
8May 13, 2026 18:0419,816173,961,476163,449,0001,027,0002,113,536
9May 13, 2026 18:0419,891174,126,122164,058,0001,040,0002,113,536