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 10, 2026 04:29lipapipalipapipaScore: 9,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 04:299,251101,579,17373,791,0002,991,0002,396,160
2Feb 10, 2026 04:299,252106,975,60471,809,0004,986,0002,387,968
3Feb 10, 2026 04:299,271105,799,59074,948,0001,998,0002,392,064
4Feb 10, 2026 04:299,353110,911,03474,642,0002,985,0002,396,160
5Feb 10, 2026 04:299,379108,349,61975,849,0001,996,0002,400,256
6Feb 10, 2026 04:299,462106,970,45876,524,0002,013,0002,408,448
7Feb 10, 2026 04:299,470102,495,08774,571,0004,030,0002,383,872
8Feb 10, 2026 04:299,473104,819,56175,606,0003,024,0002,371,584
9Feb 10, 2026 04:299,508105,987,57775,923,0002,996,0002,387,968
10Feb 10, 2026 04:299,617110,364,83976,831,0002,993,0002,371,584
11Feb 10, 2026 04:299,617105,546,82978,825,000997,0002,387,968
12Feb 10, 2026 04:299,644105,432,38777,044,0003,001,0002,347,008