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 listNov 4, 2025 17:31caandocaandoScore: 5,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 17:315,83774,581,10147,437,0001,009,0002,285,568
2Nov 4, 2025 17:315,84571,174,34747,507,0001,010,0002,285,568
3Nov 4, 2025 17:315,85575,422,79448,596,00002,285,568
4Nov 4, 2025 17:315,88180,175,63947,817,000996,0002,260,992
5Nov 4, 2025 17:315,88176,838,52546,821,0001,992,0002,265,088
6Nov 4, 2025 17:315,88379,905,51547,830,000996,0002,265,088
7Nov 4, 2025 17:315,90170,793,15746,983,0001,999,0002,285,568
8Nov 4, 2025 17:315,91074,238,06847,054,0002,002,0002,285,568
9Nov 4, 2025 17:315,92075,342,02048,134,0001,002,0002,527,232
10Nov 4, 2025 17:315,99879,246,11447,796,0001,991,0002,285,568
11Nov 4, 2025 17:316,03573,377,05849,090,0001,001,0002,285,568
12Nov 4, 2025 17:316,06073,316,29448,285,0002,011,0002,514,944