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 10:18wnwnScore: 3,419Success
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 10:193,37545,841,52526,921,0001,097,0002,482,176
2May 7, 2026 10:193,38444,208,80827,005,0001,088,0002,473,984
3May 7, 2026 10:193,38643,751,19427,040,0001,066,0002,490,368
4May 7, 2026 10:193,39145,952,99927,086,0001,064,0002,490,368
5May 7, 2026 10:193,41944,788,69927,319,0001,064,0002,473,984
6May 7, 2026 10:193,43943,468,78027,440,0001,110,0002,486,272
7May 7, 2026 10:193,49744,270,48627,949,0001,080,0002,478,080
8May 7, 2026 10:193,53946,377,72628,323,0001,057,0002,478,080
9May 7, 2026 10:193,55547,558,46928,434,0001,076,0002,486,272