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 24, 2026 04:41servant714servant714Score: 99,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 04:4199,682852,551,182661,487,000165,871,0002,285,568
2Mar 24, 2026 04:4199,812855,965,818649,560,000178,878,0002,408,448
3Mar 24, 2026 04:4199,854851,811,473619,842,000208,946,0002,285,568
4Mar 24, 2026 04:4199,920855,373,339652,476,000176,858,0002,277,376
5Mar 24, 2026 04:4199,972855,128,685646,819,000182,948,0002,285,568
6Mar 24, 2026 04:4199,990853,569,090631,939,000197,981,0002,404,352
7Mar 24, 2026 04:4199,993849,507,547645,954,000183,987,0002,404,352
8Mar 24, 2026 04:41100,180855,287,828658,599,000172,894,0002,400,256
9Mar 24, 2026 04:41101,933872,986,966650,265,000195,778,0002,285,568