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 listMar 18, 2026 15:55shartgepettoshartgepettoScore: 6,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 15:555,99380,637,90645,760,0003,979,0002,433,024
2Mar 18, 2026 15:556,01773,005,55346,948,0002,996,0002,441,216
3Mar 18, 2026 15:556,02370,695,57144,991,0004,999,0002,445,312
4Mar 18, 2026 15:556,02771,016,81147,026,0003,001,0002,367,488
5Mar 18, 2026 15:556,03574,066,36447,084,0003,005,0002,478,080
6Mar 18, 2026 15:556,04776,333,96847,183,0003,011,0002,465,792
7Mar 18, 2026 15:556,05774,447,90746,254,0004,022,0002,506,752
8Mar 18, 2026 15:556,09878,214,76948,590,0002,024,0002,473,984
9Mar 18, 2026 15:556,21078,931,19747,503,0004,042,0002,482,176