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 22, 2024 01:09RyanRyanScore: 1,826,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2024 01:091,822,67915,161,929,03515,058,266,00069,968,0002,281,472
2Oct 22, 2024 01:091,825,43515,183,129,66815,079,140,00071,972,0002,293,760
3Oct 22, 2024 01:091,826,04115,189,349,42015,083,173,00072,971,0002,289,664
4Oct 22, 2024 01:091,826,30015,188,303,24315,089,319,00068,969,0002,281,472
5Oct 22, 2024 01:091,826,47215,196,776,03515,087,744,00071,970,0002,281,472
6Oct 22, 2024 01:091,827,09515,194,176,14615,093,914,00070,971,0002,281,472
7Oct 22, 2024 01:091,827,57415,198,201,91715,084,897,00083,966,0002,281,472
8Oct 22, 2024 01:091,828,95615,212,507,62015,132,350,00047,982,0002,363,392
9Oct 22, 2024 01:091,862,33815,491,286,72715,372,442,00084,963,0002,281,472