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 7, 2026 08:42wnwnScore: 3,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 08:433,38643,776,07927,055,0001,053,0002,490,368
2May 7, 2026 08:433,39245,556,31027,053,0001,103,0002,482,176
3May 7, 2026 08:433,39843,028,26127,130,0001,080,0002,486,272
4May 7, 2026 08:433,39943,605,92327,153,0001,066,0002,494,464
5May 7, 2026 08:433,40642,259,64027,200,0001,076,0002,486,272
6May 7, 2026 08:433,42244,120,37027,301,0001,105,0002,330,624
7May 7, 2026 08:433,52443,030,51828,194,0001,059,0002,490,368
8May 7, 2026 08:433,57145,451,76328,574,0001,066,0002,490,368
9May 7, 2026 08:433,58646,839,74128,622,0001,142,0002,473,984