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 listSep 24, 2026 03:12wnwnScore: 4,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:164,29144,376,12227,051,0008,572,00020,480
2Sep 24, 2026 03:164,32244,664,61227,018,0008,855,00020,480
3Sep 24, 2026 03:164,33944,792,83327,123,0008,895,00020,480
4Sep 24, 2026 03:164,40345,939,90928,010,0008,536,00020,480
5Sep 24, 2026 03:164,46046,362,88028,455,0008,564,00020,480
6Sep 24, 2026 03:164,60746,969,38428,073,00010,170,0002,113,536
7Sep 24, 2026 03:164,62847,193,93428,640,0009,779,0002,113,536
8Sep 24, 2026 03:164,65648,074,35128,470,00010,180,0002,113,536
9Sep 24, 2026 03:164,66147,391,37228,013,00010,677,0002,113,536