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 listSep 24, 2026 05:10wnwnScore: 3,399Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 05:103,38636,905,97627,080,0001,031,0002,113,536
2Sep 24, 2026 05:103,39536,976,05627,100,0001,080,0002,113,536
3Sep 24, 2026 05:103,39636,951,69427,164,0001,027,0002,113,536
4Sep 24, 2026 05:103,39937,017,05227,174,0001,043,0002,113,536
5Sep 24, 2026 05:103,39937,019,28527,199,0001,013,0002,113,536
6Sep 24, 2026 05:103,40537,046,06227,224,0001,038,0002,113,536
7Sep 24, 2026 05:103,41937,183,06527,329,0001,050,0002,113,536
8Sep 24, 2026 05:103,57738,938,20128,658,0001,035,0002,113,536
9Sep 24, 2026 05:103,58538,545,89828,754,0001,004,0002,113,536