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 listApr 22, 2026 05:26wnwnScore: 3,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 05:263,58342,327,51828,720,0001,025,0002,486,272
2Apr 22, 2026 05:263,60644,139,89427,939,0001,995,0002,486,272
3Apr 22, 2026 05:263,60941,825,63227,958,0001,997,0002,330,624
4Apr 22, 2026 05:263,76349,264,64530,226,0001,007,0002,482,176
5Apr 22, 2026 05:263,77044,405,33330,283,0001,009,0002,486,272
6Apr 22, 2026 05:263,78050,062,66430,363,0001,012,0002,490,368
7Apr 22, 2026 05:263,84253,822,76329,902,0001,993,0002,478,080
8Apr 22, 2026 05:264,03358,832,92432,464,0001,014,0002,314,240
9Apr 22, 2026 05:264,17059,873,86533,629,000989,0002,478,080