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 listFeb 18, 2026 11:39wnwnScore: 7,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 11:396,21278,201,56347,515,0004,043,0002,478,080
2Feb 18, 2026 11:396,30176,122,40251,297,0001,005,0002,260,992
3Feb 18, 2026 11:396,33978,215,36648,569,0004,047,0002,334,720
4Feb 18, 2026 11:397,27383,982,97256,338,0004,024,0002,494,464
5Feb 18, 2026 11:397,29190,629,28057,492,0003,025,0002,494,464
6Feb 18, 2026 11:397,29387,266,35656,494,0004,035,0002,363,392