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 13, 2026 11:14Eric CeglieEric CeglieScore: 55,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 11:1455,028478,849,129397,765,00058,965,0002,404,352
2Mar 13, 2026 11:1455,162480,043,781394,869,00062,979,0002,273,280
3Mar 13, 2026 11:1455,168483,347,691399,908,00057,986,0002,478,080
4Mar 13, 2026 11:1455,281481,043,089394,859,00063,977,0002,273,280
5Mar 13, 2026 11:1455,284487,150,175396,880,00061,981,0002,269,184
6Mar 13, 2026 11:1455,348485,583,579394,337,00065,055,0002,273,280
7Mar 13, 2026 11:1455,351486,504,250395,357,00064,057,0002,400,256
8Mar 13, 2026 11:1455,378486,803,057398,686,00060,952,0002,273,280
9Mar 13, 2026 11:1455,380492,248,216400,696,00058,955,0002,269,184