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 listMar 26, 2026 05:44poyo180605poyo180605Score: 82,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 05:4482,476718,246,960632,588,00051,966,0002,281,472
2Mar 26, 2026 05:4482,498709,818,927617,758,00066,973,0002,289,664
3Mar 26, 2026 05:4482,564715,621,663623,257,00062,025,0002,523,136
4Mar 26, 2026 05:4482,568712,379,014618,379,00066,932,0002,289,664
5Mar 26, 2026 05:4482,654709,548,612619,029,00067,003,0002,281,472
6Mar 26, 2026 05:4482,684713,285,235624,253,00062,025,0002,289,664
7Mar 26, 2026 05:4482,690712,421,347622,295,00064,030,0002,289,664
8Mar 26, 2026 05:4482,898711,075,121617,046,00071,005,0002,289,664
9Mar 26, 2026 05:4482,930723,111,023625,293,00063,029,0002,265,088