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 listAug 7, 2026 14:10TonyTonyScore: 7,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 14:107,62373,172,73961,124,0002,147,0002,113,536
2Aug 7, 2026 14:107,64673,263,17861,270,0002,193,0002,113,536
3Aug 7, 2026 14:107,64673,288,38761,239,0002,223,0002,113,536
4Aug 7, 2026 14:107,64873,370,52661,237,0002,247,0002,113,536
5Aug 7, 2026 14:107,65173,298,72661,275,0002,231,0002,113,536
6Aug 7, 2026 14:107,68273,513,46561,548,0002,217,0002,113,536
7Aug 7, 2026 14:107,69473,727,96661,612,0002,254,0002,113,536
8Aug 7, 2026 14:107,69973,643,94961,640,0002,267,0002,113,536
9Aug 7, 2026 14:107,70173,815,34161,624,0002,300,0002,113,536