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 27, 2026 07:47wnwnScore: 3,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 07:483,40348,566,95527,237,0001,008,0002,482,176
2Apr 27, 2026 07:483,44743,370,64527,593,0001,021,0002,486,272
3Apr 27, 2026 07:483,45046,309,76127,615,0001,022,0002,486,272
4Apr 27, 2026 07:483,45947,512,60128,714,00002,486,272
5Apr 27, 2026 07:483,46444,065,25927,762,000991,0002,490,368
6Apr 27, 2026 07:483,47243,985,14126,832,0001,987,0002,486,272
7Apr 27, 2026 07:483,60647,935,48027,939,0001,995,0002,490,368
8Apr 27, 2026 07:483,60846,610,65227,951,0001,996,0002,486,272
9Apr 27, 2026 07:483,63945,948,62729,199,0001,006,0002,490,368