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 listOct 28, 2024 18:03RileyRileyScore: 1,826,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 28, 2024 18:031,825,63915,184,557,54615,085,833,00066,972,0002,289,664
2Oct 28, 2024 18:031,825,86515,187,080,33815,089,709,00064,968,0002,285,568
3Oct 28, 2024 18:031,825,96215,194,005,80515,078,519,00076,966,0002,281,472
4Oct 28, 2024 18:031,826,48315,195,907,23915,084,837,00074,969,0002,281,472
5Oct 28, 2024 18:031,826,54215,189,654,88415,094,329,00065,970,0002,363,392
6Oct 28, 2024 18:031,826,55915,191,963,49715,092,471,00067,970,0002,293,760
7Oct 28, 2024 18:031,826,76915,196,237,40615,089,212,00072,967,0002,281,472
8Oct 28, 2024 18:031,828,16315,202,631,52415,111,781,00061,974,0002,293,760
9Oct 28, 2024 18:031,832,16615,237,389,34315,142,007,00064,974,0002,281,472