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 listOct 16, 2026 18:57KacpxerKacpxerScore: 5,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 18:585,71956,593,86246,384,0001,085,0002,117,632
2Oct 16, 2026 18:585,83957,576,77947,354,0001,110,0002,117,632
3Oct 16, 2026 18:585,88557,872,79347,751,0001,096,0002,117,632
4Oct 16, 2026 18:585,89658,060,84447,790,0001,151,0002,117,632
5Oct 16, 2026 18:585,90358,249,40547,798,0001,201,0002,117,632
6Oct 16, 2026 18:585,93058,228,50348,108,0001,115,0002,117,632
7Oct 16, 2026 18:587,31569,697,92459,620,0001,102,0002,117,632
8Oct 16, 2026 18:587,35170,636,42859,899,0001,119,0002,117,632
9Oct 16, 2026 18:588,02275,593,03665,489,0001,101,0002,117,632