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 listSep 24, 2026 04:11wnwnScore: 3,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 04:113,36639,802,57326,931,0001,013,0002,113,536
2Sep 24, 2026 04:113,37136,736,42726,970,0001,011,0002,113,536
3Sep 24, 2026 04:113,38336,826,90027,054,0001,033,0002,113,536
4Sep 24, 2026 04:113,38336,923,24027,073,0001,006,0002,113,536
5Sep 24, 2026 04:113,44137,330,33827,524,0001,039,0002,113,536
6Sep 24, 2026 04:113,55138,931,81928,466,0001,011,0002,113,536
7Sep 24, 2026 04:113,56339,066,59328,570,0001,009,0002,113,536
8Sep 24, 2026 04:113,58139,241,54028,686,0001,039,0002,113,536
9Sep 24, 2026 04:113,58638,438,83028,727,0001,043,0002,113,536