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 1, 2026 23:18TonyTonyScore: 49,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 23:1949,310419,877,851407,258,0002,018,0002,113,536
2Aug 1, 2026 23:1949,320419,478,177407,306,0002,052,0002,113,536
3Aug 1, 2026 23:1949,393420,195,606408,957,0001,005,0002,113,536
4Aug 1, 2026 23:1949,417420,237,677409,160,0001,006,0002,113,536
5Aug 1, 2026 23:1949,430423,127,435408,265,0002,011,0002,113,536
6Aug 1, 2026 23:1949,450420,535,390409,433,0001,003,0002,113,536
7Aug 1, 2026 23:1949,501421,773,296408,843,0002,018,0002,113,536
8Aug 1, 2026 23:1949,625422,255,478410,888,0001,003,0002,113,536
9Aug 1, 2026 23:1949,719422,888,158410,652,0002,023,0002,113,536