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 3, 2021 18:08Sergey SamokhvalovSergey SamokhvalovScore: 27,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2021 18:0827,082249,677,534175,828,00048,952,0002,392,064
2Jul 3, 2021 18:0827,121247,895,887168,076,00057,025,0002,387,968
3Jul 3, 2021 18:0827,127296,993,296225,151,19602,248,704
4Jul 3, 2021 18:0827,138247,493,755176,194,00049,054,0002,265,088
5Jul 3, 2021 18:0827,139262,146,700225,252,56302,244,608
6Jul 3, 2021 18:0827,159247,926,570167,310,00058,107,0002,383,872
7Jul 3, 2021 18:0827,230265,872,005226,010,44402,240,512
8Jul 3, 2021 18:0827,231251,909,993162,014,00064,005,0002,265,088
9Jul 3, 2021 18:0827,267261,718,739168,233,00058,080,0002,260,992
10Jul 3, 2021 18:0827,321255,512,687158,833,00067,928,0002,260,992
11Jul 3, 2021 18:0827,328248,473,725167,869,00058,954,0002,260,992
12Jul 3, 2021 18:0827,483255,666,674168,078,00060,028,0002,383,872