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 13:09wnwnScore: 3,553Success
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 13:103,40544,759,47927,201,0001,065,0002,486,272
2May 9, 2026 13:103,42843,511,67827,411,0001,049,0002,478,080
3May 9, 2026 13:103,53644,809,30428,269,0001,085,0002,490,368
4May 9, 2026 13:103,53744,225,57028,307,0001,051,0002,482,176
5May 9, 2026 13:103,55345,968,77828,429,0001,065,0002,490,368
6May 9, 2026 13:103,55944,749,48328,473,0001,073,0002,482,176
7May 9, 2026 13:103,56346,585,57228,513,0001,066,0002,494,464
8May 9, 2026 13:103,57047,559,42328,552,0001,079,0002,486,272
9May 9, 2026 13:103,60243,707,07328,830,0001,069,0002,482,176