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 listSep 26, 2025 18:43sheryllynn24sheryllynn24Score: 6,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 18:436,37884,550,85050,944,0001,997,0002,285,568
2Sep 26, 2025 18:436,38078,965,12451,951,000999,0002,285,568
3Sep 26, 2025 18:436,38082,137,65850,956,0001,998,0002,285,568
4Sep 26, 2025 18:436,38879,052,95951,018,0002,000,0002,285,568
5Sep 26, 2025 18:436,38881,447,76151,022,0002,000,0002,285,568
6Sep 26, 2025 18:436,39678,363,94751,081,0002,003,0002,371,584
7Sep 26, 2025 18:436,40380,317,28552,140,0001,002,0002,285,568
8Sep 26, 2025 18:436,40679,487,41951,162,0002,006,0002,265,088
9Sep 26, 2025 18:436,40778,054,24452,171,0001,003,0002,375,680
10Sep 26, 2025 18:436,51080,026,78952,029,0002,001,0002,277,376
11Sep 26, 2025 18:436,51182,736,18152,043,0002,001,0002,269,184
12Sep 26, 2025 18:436,51581,539,86253,076,0001,001,0002,285,568