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 listJul 26, 2025 15:15Ruoyu QiuRuoyu QiuScore: 214,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2025 15:15213,9821,805,586,9821,723,076,00052,971,0002,277,376
2Jul 26, 2025 15:15213,9941,805,324,9191,712,178,00063,969,0002,260,992
3Jul 26, 2025 15:15214,0161,802,263,4631,721,357,00054,979,0002,277,376
4Jul 26, 2025 15:15214,0211,804,385,0131,696,404,00079,971,0002,285,568
5Jul 26, 2025 15:15214,0571,802,521,1241,722,687,00053,990,0002,269,184
6Jul 26, 2025 15:15214,0701,805,479,4561,711,822,00064,955,0002,265,088
7Jul 26, 2025 15:15214,0811,795,472,2421,726,903,00049,968,0002,273,280
8Jul 26, 2025 15:15214,1481,810,020,3081,722,444,00054,982,0002,523,136
9Jul 26, 2025 15:15214,4541,803,454,5601,713,009,00066,961,0002,277,376