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 29, 2026 10:44wnwnScore: 3,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 10:453,30436,144,28827,431,000020,480
2Sep 29, 2026 10:453,31136,225,28827,482,000020,480
3Sep 29, 2026 10:453,32536,281,80427,600,000020,480
4Sep 29, 2026 10:453,34136,603,87327,733,000020,480
5Sep 29, 2026 10:453,39336,948,80028,164,000020,480
6Sep 29, 2026 10:453,49438,184,97429,001,000020,480
7Sep 29, 2026 10:453,49938,551,87829,042,000020,480
8Sep 29, 2026 10:453,51837,947,54929,206,000020,480
9Sep 29, 2026 10:453,53138,800,80229,311,000020,480