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 16, 2026 13:17marko1597marko1597Score: 5,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 13:415,33154,254,25043,100,0001,148,0002,113,536
2Aug 16, 2026 13:415,33854,316,75143,174,0001,139,0002,113,536
3Aug 16, 2026 13:415,34255,087,09443,186,0001,160,0002,113,536
4Aug 16, 2026 13:415,37665,185,02543,417,0001,204,0002,113,536
5Aug 16, 2026 13:415,41455,018,42743,787,0001,150,0002,113,536
6Aug 16, 2026 13:415,49456,391,08444,445,0001,159,0002,113,536
7Aug 16, 2026 13:415,50355,697,71644,535,0001,146,0002,113,536
8Aug 16, 2026 13:415,50855,703,43944,570,0001,154,0002,113,536
9Aug 16, 2026 13:415,66056,969,26745,829,0001,156,0002,113,536