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 3, 2025 13:17Jack FrigaardJack FrigaardScore: 5,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2025 13:174,96162,906,57038,163,0003,012,0002,301,952
2Aug 3, 2025 13:174,96272,710,67438,174,0003,013,0002,514,944
3Aug 3, 2025 13:174,96568,197,92038,198,0003,015,0002,514,944
4Aug 3, 2025 13:174,97562,483,96539,275,0002,014,0002,514,944
5Aug 3, 2025 13:174,99164,363,00439,406,0002,020,0002,514,944
6Aug 3, 2025 13:175,03967,759,79838,833,0002,987,0002,449,408
7Aug 3, 2025 13:175,12070,444,81440,476,0002,023,0002,519,040
8Aug 3, 2025 13:175,12767,391,06740,528,0002,026,0002,519,040
9Aug 3, 2025 13:175,12864,141,47140,539,0002,026,0002,445,312
10Aug 3, 2025 13:175,12868,341,30840,536,0002,026,0002,519,040
11Aug 3, 2025 13:175,14170,471,66041,652,0001,015,0002,437,120
12Aug 3, 2025 13:175,19068,561,28441,072,0002,003,0002,449,408