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 16:07TonyTonyScore: 7,849Success
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 16:077,83874,877,55064,018,0001,041,0002,113,536
2Aug 7, 2026 16:077,83974,829,82064,018,0001,049,0002,113,536
3Aug 7, 2026 16:077,84774,974,27263,997,0001,139,0002,113,536
4Aug 7, 2026 16:077,84874,911,77864,014,0001,127,0002,113,536
5Aug 7, 2026 16:077,84974,952,89664,023,0001,127,0002,113,536
6Aug 7, 2026 16:077,84974,927,38464,038,0001,110,0002,113,536
7Aug 7, 2026 16:077,85074,960,68364,024,0001,134,0002,113,536
8Aug 7, 2026 16:077,85174,978,95464,050,0001,119,0002,113,536
9Aug 7, 2026 16:077,85274,947,32864,031,0001,143,0002,113,536