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 listFeb 15, 2026 23:02wnwnScore: 9,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:028,08691,003,47356,094,00011,018,0002,396,160
2Feb 15, 2026 23:028,17095,064,29958,834,0008,974,0002,502,656
3Feb 15, 2026 23:028,19389,811,29059,006,0009,000,0002,519,040
4Feb 15, 2026 23:029,19499,590,90570,289,0006,024,0002,445,312
5Feb 15, 2026 23:029,200103,231,54171,340,0005,023,0002,523,136
6Feb 15, 2026 23:029,220107,871,94470,487,0006,041,0002,375,680
7Feb 15, 2026 23:029,346108,138,11269,514,0008,059,0002,281,472
8Feb 15, 2026 23:029,364105,480,53067,756,0009,964,0002,510,848
9Feb 15, 2026 23:029,377101,594,28470,841,0006,984,0002,424,832
10Feb 15, 2026 23:029,432101,085,74670,254,0008,029,0002,441,216
11Feb 15, 2026 23:029,494107,719,12767,829,00010,972,0002,461,696
12Feb 15, 2026 23:029,514101,668,69668,972,0009,996,0002,334,720