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 31, 2026 04:53Josu San MartinJosu San MartinScore: 4,353Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 04:534,32944,353,22334,901,0001,033,0002,113,536
2Aug 31, 2026 04:534,33244,416,23234,925,0001,037,0002,113,536
3Aug 31, 2026 04:534,34444,476,26635,019,0001,044,0002,113,536
4Aug 31, 2026 04:534,34844,497,65435,051,0001,040,0002,113,536
5Aug 31, 2026 04:534,35344,671,02635,096,0001,039,0002,113,536
6Aug 31, 2026 04:534,36244,667,29335,124,0001,082,0002,113,536
7Aug 31, 2026 04:534,39044,842,42535,332,0001,112,0002,113,536
8Aug 31, 2026 04:534,44245,307,42935,822,0001,050,0002,113,536
9Aug 31, 2026 04:534,47045,536,88235,998,0001,107,0002,113,536