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 14:08wnwnScore: 3,514Success
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 14:093,38842,300,10827,060,0001,064,0002,478,080
2May 9, 2026 14:093,40642,308,54127,200,0001,073,0002,482,176
3May 9, 2026 14:093,42344,152,11227,239,0001,175,0002,486,272
4May 9, 2026 14:093,48343,311,17027,835,0001,075,0002,486,272
5May 9, 2026 14:093,51445,053,91328,080,0001,089,0002,490,368
6May 9, 2026 14:093,53944,692,32028,312,0001,068,0002,482,176
7May 9, 2026 14:093,54644,151,30928,359,0001,076,0002,486,272
8May 9, 2026 14:093,55643,301,60628,438,0001,080,0002,473,984
9May 9, 2026 14:093,56044,865,04328,473,0001,075,0002,482,176