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 listMay 9, 2026 12:19wnwnScore: 3,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 12:193,38240,705,29727,030,0001,048,0002,486,272
2May 9, 2026 12:193,38643,388,27227,041,0001,066,0002,486,272
3May 9, 2026 12:193,40942,868,86327,172,0001,128,0002,490,368
4May 9, 2026 12:193,49142,654,66027,931,0001,052,0002,486,272
5May 9, 2026 12:193,53744,111,65628,317,0001,042,0002,486,272
6May 9, 2026 12:193,54644,901,86028,370,0001,062,0002,486,272
7May 9, 2026 12:193,54643,113,77328,379,0001,054,0002,486,272
8May 9, 2026 12:193,56146,507,66328,507,0001,057,0002,490,368
9May 9, 2026 12:193,56243,829,15328,472,0001,093,0002,482,176